Base | Representation |
---|---|
bin | 11110110111100001111… |
… | …110000001110111110001 |
3 | 21111210012202212101200020 |
4 | 132313201332001313301 |
5 | 234223214230323441 |
6 | 4302245340114053 |
7 | 306152363412465 |
oct | 36674176016761 |
9 | 7453182771606 |
10 | 2121210011121 |
11 | 74866682a1a3 |
12 | 2a3130b35929 |
13 | 12504c339846 |
14 | 7494a7b04a5 |
15 | 3a29e2e9e66 |
hex | 1ede1f81df1 |
2121210011121 has 16 divisors (see below), whose sum is σ = 2919594382848. Its totient is φ = 1368485308800.
The previous prime is 2121210011119. The next prime is 2121210011153. The reversal of 2121210011121 is 1211100121212.
It is a happy number.
It is not a de Polignac number, because 2121210011121 - 21 = 2121210011119 is a prime.
It is a super-3 number, since 3×21212100111213 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2121210011121.
It is not an unprimeable number, because it can be changed into a prime (2121210011321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3352765 + ... + 3934901.
It is an arithmetic number, because the mean of its divisors is an integer number (182474648928).
Almost surely, 22121210011121 is an apocalyptic number.
It is an amenable number.
2121210011121 is a deficient number, since it is larger than the sum of its proper divisors (798384371727).
2121210011121 is a wasteful number, since it uses less digits than its factorization.
2121210011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621352.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 2121210011121 its reverse (1211100121212), we get a palindrome (3332310132333).
The spelling of 2121210011121 in words is "two trillion, one hundred twenty-one billion, two hundred ten million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •