Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …111000101010111111100 |
3 | 10220011022001001112111011 |
4 | 100000131033011113330 |
5 | 121010301020334322 |
6 | 2201200051005004 |
7 | 142321035520561 |
oct | 20003517052774 |
9 | 3804261045434 |
10 | 1100002121212 |
11 | 39456557a765 |
12 | 159230599764 |
13 | 7c96436b927 |
14 | 3b35189a868 |
15 | 1d930c6e677 |
hex | 1001d3c55fc |
1100002121212 has 48 divisors (see below), whose sum is σ = 2030687820000. Its totient is φ = 520571367680.
The previous prime is 1100002121051. The next prime is 1100002121249. The reversal of 1100002121212 is 2121212000011.
It is a junction number, because it is equal to n+sod(n) for n = 1100002121192 and 1100002121201.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 7185039 + ... + 7336537.
It is an arithmetic number, because the mean of its divisors is an integer number (42305996250).
Almost surely, 21100002121212 is an apocalyptic number.
It is an amenable number.
1100002121212 is a deficient number, since it is larger than the sum of its proper divisors (930685698788).
1100002121212 is a wasteful number, since it uses less digits than its factorization.
1100002121212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152766 (or 152764 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1100002121212 its reverse (2121212000011), we get a palindrome (3221214121223).
The spelling of 1100002121212 in words is "one trillion, one hundred billion, two million, one hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •