Base | Representation |
---|---|
bin | 1001001100000000111000… |
… | …1111011111001100000010 |
3 | 1022202202000220000210202112 |
4 | 2103000032033133030002 |
5 | 2311002400004133442 |
6 | 33252443510215322 |
7 | 2061563012253134 |
oct | 223001617371402 |
9 | 38682026023675 |
10 | 10102002021122 |
11 | 3245264867230 |
12 | 1171a04054542 |
13 | 5837cb66c23b |
14 | 26cd22013054 |
15 | 127b99cde082 |
hex | 9300e3df302 |
10102002021122 has 8 divisors (see below), whose sum is σ = 16530548761872. Its totient is φ = 4591819100500.
The previous prime is 10102002021113. The next prime is 10102002021131. The reversal of 10102002021122 is 22112020020101.
It is an interprime number because it is at equal distance from previous prime (10102002021113) and next prime (10102002021131).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10102002021097 and 10102002021106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 229590955004 + ... + 229590955047.
It is an arithmetic number, because the mean of its divisors is an integer number (2066318595234).
Almost surely, 210102002021122 is an apocalyptic number.
10102002021122 is a deficient number, since it is larger than the sum of its proper divisors (6428546740750).
10102002021122 is a wasteful number, since it uses less digits than its factorization.
10102002021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459181910064.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10102002021122 its reverse (22112020020101), we get a palindrome (32214022041223).
The spelling of 10102002021122 in words is "ten trillion, one hundred two billion, two million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •