Base | Representation |
---|---|
bin | 1001001101001000000010… |
… | …1000101100010001011001 |
3 | 1022211120022221022112201210 |
4 | 2103102000220230101121 |
5 | 2311311003340200441 |
6 | 33305323013533333 |
7 | 2063140214614164 |
oct | 223220050542131 |
9 | 38746287275653 |
10 | 10121101100121 |
11 | 3252375794a40 |
12 | 1175654344249 |
13 | 5855534ba20b |
14 | 26dc147bcadb |
15 | 1284168ea616 |
hex | 93480a2c459 |
10121101100121 has 64 divisors (see below), whose sum is σ = 14949328896000. Its totient is φ = 6039566158080.
The previous prime is 10121101100057. The next prime is 10121101100147. The reversal of 10121101100121 is 12100110112101.
It is not a de Polignac number, because 10121101100121 - 26 = 10121101100057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10121101100097 and 10121101100106.
It is not an unprimeable number, because it can be changed into a prime (10121101100021) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2267777536 + ... + 2267781998.
It is an arithmetic number, because the mean of its divisors is an integer number (233583264000).
Almost surely, 210121101100121 is an apocalyptic number.
10121101100121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10121101100121 is a deficient number, since it is larger than the sum of its proper divisors (4828227795879).
10121101100121 is a wasteful number, since it uses less digits than its factorization.
10121101100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6774.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10121101100121 its reverse (12100110112101), we get a palindrome (22221211212222).
The spelling of 10121101100121 in words is "ten trillion, one hundred twenty-one billion, one hundred one million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •