Base | Representation |
---|---|
bin | 11111110110100101101000… |
… | …011111011100000010011001 |
3 | 200101000112120211212022011212 |
4 | 133312211220133130002121 |
5 | 121330221224022143101 |
6 | 1213540440232032505 |
7 | 41336135114131523 |
oct | 3766455037340231 |
9 | 611015524768155 |
10 | 140090701365401 |
11 | 40701150844566 |
12 | 13866624532735 |
13 | 602265b92c697 |
14 | 26845d73daa13 |
15 | 112e13220a1bb |
hex | 7f69687dc099 |
140090701365401 has 2 divisors, whose sum is σ = 140090701365402. Its totient is φ = 140090701365400.
The previous prime is 140090701365383. The next prime is 140090701365403. The reversal of 140090701365401 is 104563107090041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83307167180176 + 56783534185225 = 9127276^2 + 7535485^2 .
It is an emirp because it is prime and its reverse (104563107090041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140090701365401 - 26 = 140090701365337 is a prime.
Together with 140090701365403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (140090701365403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70045350682700 + 70045350682701.
It is an arithmetic number, because the mean of its divisors is an integer number (70045350682701).
Almost surely, 2140090701365401 is an apocalyptic number.
It is an amenable number.
140090701365401 is a deficient number, since it is larger than the sum of its proper divisors (1).
140090701365401 is an equidigital number, since it uses as much as digits as its factorization.
140090701365401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90720, while the sum is 41.
The spelling of 140090701365401 in words is "one hundred forty trillion, ninety billion, seven hundred one million, three hundred sixty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •