Base | Representation |
---|---|
bin | 11111110101011100010110… |
… | …001111011010111001101001 |
3 | 200100202000110211222112221210 |
4 | 133311130112033122321221 |
5 | 121322424100034222101 |
6 | 1213440344054223333 |
7 | 41330351115560340 |
oct | 3765342617327151 |
9 | 610660424875853 |
10 | 140012012023401 |
11 | 40680840755211 |
12 | 13853323654b49 |
13 | 60180cb1c4a5b |
14 | 2680890758b57 |
15 | 112c078d347d6 |
hex | 7f57163dae69 |
140012012023401 has 32 divisors (see below), whose sum is σ = 213407544913920. Its totient is φ = 79985901288384.
The previous prime is 140012012023397. The next prime is 140012012023439. The reversal of 140012012023401 is 104320210210041.
It is not a de Polignac number, because 140012012023401 - 22 = 140012012023397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (140012012043401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1557218635 + ... + 1557308543.
It is an arithmetic number, because the mean of its divisors is an integer number (6668985778560).
Almost surely, 2140012012023401 is an apocalyptic number.
It is an amenable number.
140012012023401 is a deficient number, since it is larger than the sum of its proper divisors (73395532890519).
140012012023401 is a wasteful number, since it uses less digits than its factorization.
140012012023401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108525.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 140012012023401 its reverse (104320210210041), we get a palindrome (244332222233442).
The spelling of 140012012023401 in words is "one hundred forty trillion, twelve billion, twelve million, twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •