Base | Representation |
---|---|
bin | 1001001000111111100011… |
… | …11000100011001010010001 |
3 | 2122011120011012110121011211 |
4 | 10210133301320203022101 |
5 | 10113310212242023441 |
6 | 110425524204340121 |
7 | 4143122641636150 |
oct | 444376170431221 |
9 | 78146135417154 |
10 | 20100210111121 |
11 | 644a4a6661798 |
12 | 230767b844641 |
13 | b2a5984aaa8a |
14 | 4d6bd9173597 |
15 | 24ccbc775a81 |
hex | 1247f1e23291 |
20100210111121 has 8 divisors (see below), whose sum is σ = 23063189292864. Its totient is φ = 17160111078000.
The previous prime is 20100210111103. The next prime is 20100210111127. The reversal of 20100210111121 is 12111101200102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20100210111121 - 27 = 20100210110993 is a prime.
It is a super-2 number, since 2×201002101111212 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20100210111127) 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, 5720035270 + ... + 5720038783.
It is an arithmetic number, because the mean of its divisors is an integer number (2882898661608).
Almost surely, 220100210111121 is an apocalyptic number.
It is an amenable number.
20100210111121 is a deficient number, since it is larger than the sum of its proper divisors (2962979181743).
20100210111121 is a wasteful number, since it uses less digits than its factorization.
20100210111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11440074311.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20100210111121 its reverse (12111101200102), we get a palindrome (32211311311223).
The spelling of 20100210111121 in words is "twenty trillion, one hundred billion, two hundred ten million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •