Base | Representation |
---|---|
bin | 1001001100011111100000… |
… | …1100001110011111001001 |
3 | 1022210112020202101002212020 |
4 | 2103013320030032133021 |
5 | 2311121213313031441 |
6 | 33300323305035053 |
7 | 2062303504040253 |
oct | 223077014163711 |
9 | 38715222332766 |
10 | 10110222002121 |
11 | 32487a282465a |
12 | 1173518a85a89 |
13 | 58450b644217 |
14 | 26d4a19c0cd3 |
15 | 127ecb78de66 |
hex | 931f830e7c9 |
10110222002121 has 16 divisors (see below), whose sum is σ = 13521568162560. Its totient is φ = 6719526933840.
The previous prime is 10110222002113. The next prime is 10110222002123. The reversal of 10110222002121 is 12120022201101.
10110222002121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10110222002121 - 23 = 10110222002113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110222002121.
It is not an unprimeable number, because it can be changed into a prime (10110222002123) 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, 820666 + ... + 4570988.
It is an arithmetic number, because the mean of its divisors is an integer number (845098010160).
Almost surely, 210110222002121 is an apocalyptic number.
It is an amenable number.
10110222002121 is a deficient number, since it is larger than the sum of its proper divisors (3411346160439).
10110222002121 is a wasteful number, since it uses less digits than its factorization.
10110222002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3753076.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10110222002121 its reverse (12120022201101), we get a palindrome (22230244203222).
The spelling of 10110222002121 in words is "ten trillion, one hundred ten billion, two hundred twenty-two million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •