Base | Representation |
---|---|
bin | 11001100010001… |
… | …11100001000001 |
3 | 112221001121111110 |
4 | 30301013201001 |
5 | 414313434213 |
6 | 33131033533 |
7 | 5210455614 |
oct | 1461074101 |
9 | 487047443 |
10 | 214202433 |
11 | aaa03505 |
12 | 5b89b8a9 |
13 | 354ba903 |
14 | 2063c17b |
15 | 13c125c3 |
hex | cc47841 |
214202433 has 4 divisors (see below), whose sum is σ = 285603248. Its totient is φ = 142801620.
The previous prime is 214202419. The next prime is 214202501. The reversal of 214202433 is 334202412.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 214202433 - 210 = 214201409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (214202413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35700403 + ... + 35700408.
It is an arithmetic number, because the mean of its divisors is an integer number (71400812).
Almost surely, 2214202433 is an apocalyptic number.
It is an amenable number.
214202433 is a deficient number, since it is larger than the sum of its proper divisors (71400815).
214202433 is an equidigital number, since it uses as much as digits as its factorization.
214202433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71400814.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 214202433 is about 14635.6562203408. The cubic root of 214202433 is about 598.3309475226.
Subtracting from 214202433 its sum of digits (21), we obtain a palindrome (214202412).
Adding to 214202433 its reverse (334202412), we get a palindrome (548404845).
The spelling of 214202433 in words is "two hundred fourteen million, two hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •