Base | Representation |
---|---|
bin | 11111110101011100010101… |
… | …100001100110110001111001 |
3 | 200100202000110000101101101011 |
4 | 133311130111201212301321 |
5 | 121322424034000412213 |
6 | 1213440342544553521 |
7 | 41330350611520012 |
oct | 3765342541466171 |
9 | 610660400341334 |
10 | 140012000013433 |
11 | 406808349a1a19 |
12 | 1385331b6228a1 |
13 | 60180c887b372 |
14 | 268088cd10009 |
15 | 112c077c6103d |
hex | 7f5715866c79 |
140012000013433 has 2 divisors, whose sum is σ = 140012000013434. Its totient is φ = 140012000013432.
The previous prime is 140012000013409. The next prime is 140012000013439. The reversal of 140012000013433 is 334310000210041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86680717821504 + 53331282191929 = 9310248^2 + 7302827^2 .
It is an emirp because it is prime and its reverse (334310000210041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140012000013433 - 229 = 140011463142521 is a prime.
It is not a weakly prime, because it can be changed into another prime (140012000013439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70006000006716 + 70006000006717.
It is an arithmetic number, because the mean of its divisors is an integer number (70006000006717).
Almost surely, 2140012000013433 is an apocalyptic number.
It is an amenable number.
140012000013433 is a deficient number, since it is larger than the sum of its proper divisors (1).
140012000013433 is an equidigital number, since it uses as much as digits as its factorization.
140012000013433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 140012000013433 its reverse (334310000210041), we get a palindrome (474322000223474).
The spelling of 140012000013433 in words is "one hundred forty trillion, twelve billion, thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •