Base | Representation |
---|---|
bin | 1100110000110010000011… |
… | …1010110011011110001001 |
3 | 1211200110120212112221200100 |
4 | 3030030200322303132021 |
5 | 3314400431333121441 |
6 | 45502150344400013 |
7 | 2645536153526064 |
oct | 314144072633611 |
9 | 54613525487610 |
10 | 14032210442121 |
11 | 4520032a80593 |
12 | 16a7652a76009 |
13 | 7aa302265561 |
14 | 36723c2b18db |
15 | 195023b07cb6 |
hex | cc320eb3789 |
14032210442121 has 24 divisors (see below), whose sum is σ = 20304897319616. Its totient is φ = 9338129491680.
The previous prime is 14032210442099. The next prime is 14032210442143. The reversal of 14032210442121 is 12124401223041.
14032210442121 is a `hidden beast` number, since 1 + 4 + 0 + 3 + 2 + 210 + 4 + 421 + 21 = 666.
It is an interprime number because it is at equal distance from previous prime (14032210442099) and next prime (14032210442143).
It is not a de Polignac number, because 14032210442121 - 29 = 14032210441609 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 (14032210402121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25321791 + ... + 25870011.
Almost surely, 214032210442121 is an apocalyptic number.
It is an amenable number.
14032210442121 is a deficient number, since it is larger than the sum of its proper divisors (6272686877495).
14032210442121 is a wasteful number, since it uses less digits than its factorization.
14032210442121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553293 (or 553290 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 14032210442121 its reverse (12124401223041), we get a palindrome (26156611665162).
The spelling of 14032210442121 in words is "fourteen trillion, thirty-two billion, two hundred ten million, four hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •