Base | Representation |
---|---|
bin | 11111110101011100010101… |
… | …100001100100001111001101 |
3 | 200100202000110000100212002112 |
4 | 133311130111201210033031 |
5 | 121322424034000044041 |
6 | 1213440342544433405 |
7 | 41330350611444446 |
oct | 3765342541441715 |
9 | 610660400325075 |
10 | 140012000003021 |
11 | 40680834995113 |
12 | 1385331b618865 |
13 | 60180c88766c3 |
14 | 268088cd0a2cd |
15 | 112c077c5cdeb |
hex | 7f57158643cd |
140012000003021 has 2 divisors, whose sum is σ = 140012000003022. Its totient is φ = 140012000003020.
The previous prime is 140012000002939. The next prime is 140012000003047. The reversal of 140012000003021 is 120300000210041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127877332257796 + 12134667745225 = 11308286^2 + 3483485^2 .
It is a cyclic number.
It is not a de Polignac number, because 140012000003021 - 226 = 140011932894157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140012000002987 and 140012000003005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140012000005021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70006000001510 + 70006000001511.
It is an arithmetic number, because the mean of its divisors is an integer number (70006000001511).
Almost surely, 2140012000003021 is an apocalyptic number.
It is an amenable number.
140012000003021 is a deficient number, since it is larger than the sum of its proper divisors (1).
140012000003021 is an equidigital number, since it uses as much as digits as its factorization.
140012000003021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 140012000003021 its reverse (120300000210041), we get a palindrome (260312000213062).
The spelling of 140012000003021 in words is "one hundred forty trillion, twelve billion, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •