Base | Representation |
---|---|
bin | 11111110111000010111001… |
… | …010011101110010100000101 |
3 | 200101010112200121100221102201 |
4 | 133313002321103232110011 |
5 | 121331230101214120401 |
6 | 1214003114133434501 |
7 | 41341326544240024 |
oct | 3767027123562405 |
9 | 611115617327381 |
10 | 140122122020101 |
11 | 407135049a4491 |
12 | 1387073319ba31 |
13 | 60255c8425660 |
14 | 2685d383b28bb |
15 | 112ed70908b01 |
hex | 7f70b94ee505 |
140122122020101 has 16 divisors (see below), whose sum is σ = 157465455114240. Its totient is φ = 123716876279040.
The previous prime is 140122122020059. The next prime is 140122122020143. The reversal of 140122122020101 is 101020221221041.
It is an interprime number because it is at equal distance from previous prime (140122122020059) and next prime (140122122020143).
It is a cyclic number.
It is not a de Polignac number, because 140122122020101 - 213 = 140122122011909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140122122020701) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6771420 + ... + 18058138.
It is an arithmetic number, because the mean of its divisors is an integer number (9841590944640).
Almost surely, 2140122122020101 is an apocalyptic number.
It is an amenable number.
140122122020101 is a deficient number, since it is larger than the sum of its proper divisors (17343333094139).
140122122020101 is a wasteful number, since it uses less digits than its factorization.
140122122020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11328276.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 140122122020101 its reverse (101020221221041), we get a palindrome (241142343241142).
The spelling of 140122122020101 in words is "one hundred forty trillion, one hundred twenty-two billion, one hundred twenty-two million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •