Base | Representation |
---|---|
bin | 1001001101000111101010… |
… | …1011100110100111101111 |
3 | 1022211120001222100002200102 |
4 | 2103101322223212213233 |
5 | 2311310302301400421 |
6 | 33305305044421315 |
7 | 2063134562516414 |
oct | 223217253464757 |
9 | 38746058302612 |
10 | 10121001200111 |
11 | 325232436164a |
12 | 11756269a783b |
13 | 5855388b0099 |
14 | 26dc0541610b |
15 | 12840cc6560b |
hex | 9347aae69ef |
10121001200111 has 8 divisors (see below), whose sum is σ = 10487209396224. Its totient is φ = 9757275771960.
The previous prime is 10121001200083. The next prime is 10121001200117. The reversal of 10121001200111 is 11100210012101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10121001200111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10121001200092 and 10121001200101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121001200117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 620683691 + ... + 620699996.
It is an arithmetic number, because the mean of its divisors is an integer number (1310901174528).
Almost surely, 210121001200111 is an apocalyptic number.
10121001200111 is a deficient number, since it is larger than the sum of its proper divisors (366208196113).
10121001200111 is a wasteful number, since it uses less digits than its factorization.
10121001200111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1241383981.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10121001200111 its reverse (11100210012101), we get a palindrome (21221211212212).
The spelling of 10121001200111 in words is "ten trillion, one hundred twenty-one billion, one million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •