Base | Representation |
---|---|
bin | 1001000110101010111010… |
… | …0011000000011100011001 |
3 | 1022102222002012111022211120 |
4 | 2101222232203000130121 |
5 | 2303001343231241441 |
6 | 33142342353515453 |
7 | 2052133066616046 |
oct | 221525643003431 |
9 | 38388065438746 |
10 | 10010202212121 |
11 | 320a337201a91 |
12 | 1158064572b89 |
13 | 577c5b9c5b27 |
14 | 2686d408c1cd |
15 | 1255c5945966 |
hex | 91aae8c0719 |
10010202212121 has 48 divisors (see below), whose sum is σ = 13980600345600. Its totient is φ = 6369445938240.
The previous prime is 10010202212117. The next prime is 10010202212137. The reversal of 10010202212121 is 12121220201001.
It is not a de Polignac number, because 10010202212121 - 22 = 10010202212117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10010202212121.
It is not an unprimeable number, because it can be changed into a prime (10010202212191) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 57941550 + ... + 58114056.
It is an arithmetic number, because the mean of its divisors is an integer number (291262507200).
Almost surely, 210010202212121 is an apocalyptic number.
It is an amenable number.
10010202212121 is a deficient number, since it is larger than the sum of its proper divisors (3970398133479).
10010202212121 is a wasteful number, since it uses less digits than its factorization.
10010202212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172854 (or 172817 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10010202212121 its reverse (12121220201001), we get a palindrome (22131422413122).
The spelling of 10010202212121 in words is "ten trillion, ten billion, two hundred two million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •