Base | Representation |
---|---|
bin | 11010001001111100… |
… | …00001101010100001 |
3 | 1100020121112010122102 |
4 | 31010332001222201 |
5 | 212224223343241 |
6 | 10241213020145 |
7 | 1004655064301 |
oct | 150476015241 |
9 | 40217463572 |
10 | 14042012321 |
11 | 5a56393767 |
12 | 287a784655 |
13 | 142a22b63c |
14 | 972cd1601 |
15 | 572b8139b |
hex | 344f81aa1 |
14042012321 has 2 divisors, whose sum is σ = 14042012322. Its totient is φ = 14042012320.
The previous prime is 14042012297. The next prime is 14042012353. The reversal of 14042012321 is 12321024041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9323833600 + 4718178721 = 96560^2 + 68689^2 .
It is an emirp because it is prime and its reverse (12321024041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14042012321 - 226 = 13974903457 is a prime.
It is a super-2 number, since 2×140420123212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14042012293 and 14042012302.
It is not a weakly prime, because it can be changed into another prime (14042012221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7021006160 + 7021006161.
It is an arithmetic number, because the mean of its divisors is an integer number (7021006161).
Almost surely, 214042012321 is an apocalyptic number.
It is an amenable number.
14042012321 is a deficient number, since it is larger than the sum of its proper divisors (1).
14042012321 is an equidigital number, since it uses as much as digits as its factorization.
14042012321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 14042012321 its reverse (12321024041), we get a palindrome (26363036362).
The spelling of 14042012321 in words is "fourteen billion, forty-two million, twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •