Base | Representation |
---|---|
bin | 11110110111011100000… |
… | …000101100000111011111 |
3 | 21111202221210202121010220 |
4 | 132313130000230013133 |
5 | 234223013132421101 |
6 | 4302231405332423 |
7 | 306150040621506 |
oct | 36673400540737 |
9 | 7452853677126 |
10 | 2121110045151 |
11 | 748615361299 |
12 | 2a3103567113 |
13 | 125034708696 |
14 | 7493b3cb83d |
15 | 3a295650636 |
hex | 1eddc02c1df |
2121110045151 has 8 divisors (see below), whose sum is σ = 2832287500800. Its totient is φ = 1412002976472.
The previous prime is 2121110045113. The next prime is 2121110045183. The reversal of 2121110045151 is 1515400111212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2121110045151 - 211 = 2121110043103 is a prime.
It is a super-2 number, since 2×21211100451512 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121110045191) 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 7 ways as a sum of consecutive naturals, for example, 517594351 + ... + 517598448.
It is an arithmetic number, because the mean of its divisors is an integer number (354035937600).
Almost surely, 22121110045151 is an apocalyptic number.
2121110045151 is a deficient number, since it is larger than the sum of its proper divisors (711177455649).
2121110045151 is a wasteful number, since it uses less digits than its factorization.
2121110045151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035193485.
The product of its (nonzero) digits is 400, while the sum is 24.
Adding to 2121110045151 its reverse (1515400111212), we get a palindrome (3636510156363).
The spelling of 2121110045151 in words is "two trillion, one hundred twenty-one billion, one hundred ten million, forty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •