Base | Representation |
---|---|
bin | 1001010001110101110111… |
… | …0011100000001000000110 |
3 | 1100010022110100202111021020 |
4 | 2110131131303200020012 |
5 | 2314122421001010042 |
6 | 33410442325532010 |
7 | 2102036033416452 |
oct | 224353563401006 |
9 | 40108410674236 |
10 | 10202121110022 |
11 | 3283771441606 |
12 | 11892a5874006 |
13 | 590095a46c8a |
14 | 273adcbd3662 |
15 | 12a5a96ee3ec |
hex | 9475dce0206 |
10202121110022 has 8 divisors (see below), whose sum is σ = 20404242220056. Its totient is φ = 3400707036672.
The previous prime is 10202121110017. The next prime is 10202121110057. The reversal of 10202121110022 is 22001112120201.
It is a sphenic number, since it is the product of 3 distinct primes.
10202121110022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10202121109983 and 10202121110010.
It is a congruent number.
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, 850176759163 + ... + 850176759174.
It is an arithmetic number, because the mean of its divisors is an integer number (2550530277507).
Almost surely, 210202121110022 is an apocalyptic number.
10202121110022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202121110022 is a wasteful number, since it uses less digits than its factorization.
10202121110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700353518342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10202121110022 its reverse (22001112120201), we get a palindrome (32203233230223).
The spelling of 10202121110022 in words is "ten trillion, two hundred two billion, one hundred twenty-one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •