Base | Representation |
---|---|
bin | 11110110111010101101… |
… | …000011101101001000110 |
3 | 21111202200100101201110220 |
4 | 132313111220131221012 |
5 | 234222303233443420 |
6 | 4302213023525210 |
7 | 306144301204305 |
oct | 36672550355106 |
9 | 7452610351426 |
10 | 2121003031110 |
11 | 74856aa0a037 |
12 | 2a3093759806 |
13 | 1250184aa472 |
14 | 7492b0d243c |
15 | 3a28b062840 |
hex | 1edd5a1da46 |
2121003031110 has 96 divisors (see below), whose sum is σ = 5147776737792. Its totient is φ = 559296599040.
The previous prime is 2121003031067. The next prime is 2121003031157. The reversal of 2121003031110 is 111303001212.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2121003031110.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 443443779 + ... + 443448561.
It is an arithmetic number, because the mean of its divisors is an integer number (53622674352).
Almost surely, 22121003031110 is an apocalyptic number.
2121003031110 is an abundant number, since it is smaller than the sum of its proper divisors (3026773706682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2121003031110 is a wasteful number, since it uses less digits than its factorization.
2121003031110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6558 (or 6461 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 2121003031110 its reverse (111303001212), we get a palindrome (2232306032322).
The spelling of 2121003031110 in words is "two trillion, one hundred twenty-one billion, three million, thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •