Base | Representation |
---|---|
bin | 11001100010100… |
… | …01011100000001 |
3 | 112221010200020122 |
4 | 30301101130001 |
5 | 414321234243 |
6 | 33131550025 |
7 | 5211015242 |
oct | 1461213401 |
9 | 487120218 |
10 | 214243073 |
11 | aaa30aa0 |
12 | 5b8bb315 |
13 | 35503265 |
14 | 2064ccc9 |
15 | 13c1e668 |
hex | cc51701 |
214243073 has 8 divisors (see below), whose sum is σ = 234393600. Its totient is φ = 194204880.
The previous prime is 214243067. The next prime is 214243079. The reversal of 214243073 is 370342412.
It is an interprime number because it is at equal distance from previous prime (214243067) and next prime (214243079).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 214243073 - 224 = 197465857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (214243079) 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 7 ways as a sum of consecutive naturals, for example, 24065 + ... + 31742.
It is an arithmetic number, because the mean of its divisors is an integer number (29299200).
Almost surely, 2214243073 is an apocalyptic number.
It is an amenable number.
214243073 is a deficient number, since it is larger than the sum of its proper divisors (20150527).
214243073 is a wasteful number, since it uses less digits than its factorization.
214243073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56167.
The product of its (nonzero) digits is 4032, while the sum is 26.
The square root of 214243073 is about 14637.0445445793. The cubic root of 214243073 is about 598.3687849890.
Adding to 214243073 its reverse (370342412), we get a palindrome (584585485).
The spelling of 214243073 in words is "two hundred fourteen million, two hundred forty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •