Base | Representation |
---|---|
bin | 1001010010010111101100… |
… | …0001010101111011011001 |
3 | 1100011011220011120110200222 |
4 | 2110211323001111323121 |
5 | 2314300020002241441 |
6 | 33414543332005425 |
7 | 2102510041130360 |
oct | 224457301257331 |
9 | 40134804513628 |
10 | 10211201212121 |
11 | 3287600973718 |
12 | 118abba760875 |
13 | 590bb1c91c60 |
14 | 274320ada7d7 |
15 | 12a93b94ed4b |
hex | 9497b055ed9 |
10211201212121 has 16 divisors (see below), whose sum is σ = 12708841622400. Its totient is φ = 7988414721408.
The previous prime is 10211201212111. The next prime is 10211201212153. The reversal of 10211201212121 is 12121210211201.
It is a cyclic number.
It is not a de Polignac number, because 10211201212121 - 210 = 10211201211097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10211201212121.
It is not an unprimeable number, because it can be changed into a prime (10211201212111) 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 15 ways as a sum of consecutive naturals, for example, 630390791 + ... + 630406988.
It is an arithmetic number, because the mean of its divisors is an integer number (794302601400).
Almost surely, 210211201212121 is an apocalyptic number.
It is an amenable number.
10211201212121 is a deficient number, since it is larger than the sum of its proper divisors (2497640410279).
10211201212121 is a wasteful number, since it uses less digits than its factorization.
10211201212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1260797888.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10211201212121 its reverse (12121210211201), we get a palindrome (22332411423322).
The spelling of 10211201212121 in words is "ten trillion, two hundred eleven billion, two hundred one million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •