Base | Representation |
---|---|
bin | 1001010001101110011000… |
… | …0000010110011001011001 |
3 | 1100010010021021210002200020 |
4 | 2110123212000112121121 |
5 | 2314104311432241441 |
6 | 33405511050501053 |
7 | 2101635156522015 |
oct | 224334600263131 |
9 | 40103237702606 |
10 | 10200111212121 |
11 | 328292a954566 |
12 | 1188a24734789 |
13 | 58cb3551568c |
14 | 27398bcbd545 |
15 | 12a4dd033e66 |
hex | 946e6016659 |
10200111212121 has 32 divisors (see below), whose sum is σ = 13870354368000. Its totient is φ = 6666233333760.
The previous prime is 10200111212069. The next prime is 10200111212153. The reversal of 10200111212121 is 12121211100201.
It is a happy number.
It is not a de Polignac number, because 10200111212121 - 231 = 10197963728473 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10200111212121.
It is not an unprimeable number, because it can be changed into a prime (10200111212321) 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 31 ways as a sum of consecutive naturals, for example, 88966785 + ... + 89081361.
It is an arithmetic number, because the mean of its divisors is an integer number (433448574000).
Almost surely, 210200111212121 is an apocalyptic number.
It is an amenable number.
10200111212121 is a deficient number, since it is larger than the sum of its proper divisors (3670243155879).
10200111212121 is a wasteful number, since it uses less digits than its factorization.
10200111212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117329.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10200111212121 its reverse (12121211100201), we get a palindrome (22321322312322).
The spelling of 10200111212121 in words is "ten trillion, two hundred billion, one hundred eleven million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •