Base | Representation |
---|---|
bin | 1001001101000111101111… |
… | …1011101110000010010010 |
3 | 1022211120010102212002212020 |
4 | 2103101323323232002102 |
5 | 2311310323140431002 |
6 | 33305311114512310 |
7 | 2063135236160415 |
oct | 223217373560222 |
9 | 38746112762766 |
10 | 10121022202002 |
11 | 32523351a6688 |
12 | 1175631a35696 |
13 | 58554005453a |
14 | 26dc08121b7c |
15 | 12840ea132bc |
hex | 9347beee092 |
10121022202002 has 8 divisors (see below), whose sum is σ = 20242044404016. Its totient is φ = 3373674067332.
The previous prime is 10121022201989. The next prime is 10121022202003. The reversal of 10121022202002 is 20020222012101.
It is a sphenic number, since it is the product of 3 distinct primes.
10121022202002 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (10121022202003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 843418516828 + ... + 843418516839.
It is an arithmetic number, because the mean of its divisors is an integer number (2530255550502).
Almost surely, 210121022202002 is an apocalyptic number.
10121022202002 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.
10121022202002 is a wasteful number, since it uses less digits than its factorization.
10121022202002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1686837033672.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10121022202002 its reverse (20020222012101), we get a palindrome (30141244214103).
The spelling of 10121022202002 in words is "ten trillion, one hundred twenty-one billion, twenty-two million, two hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •