Base | Representation |
---|---|
bin | 11110101101000110011… |
… | …110000010000000100010 |
3 | 21110201022022100212021210 |
4 | 132231012132002000202 |
5 | 234032300333020002 |
6 | 4253154211130550 |
7 | 305305021305630 |
oct | 36550636020042 |
9 | 7421268325253 |
10 | 2110011220002 |
11 | 74393a364724 |
12 | 2a0b265a3a56 |
13 | 123c8618c21a |
14 | 741a7354350 |
15 | 39d4608e96c |
hex | 1eb46782022 |
2110011220002 has 32 divisors (see below), whose sum is σ = 4840679430144. Its totient is φ = 600635768400.
The previous prime is 2110011219971. The next prime is 2110011220007. The reversal of 2110011220002 is 2000221100112.
It is a self number, because there is not a number n which added to its sum of digits gives 2110011220002.
It is not an unprimeable number, because it can be changed into a prime (2110011220007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92679324 + ... + 92702087.
It is an arithmetic number, because the mean of its divisors is an integer number (151271232192).
Almost surely, 22110011220002 is an apocalyptic number.
2110011220002 is an abundant number, since it is smaller than the sum of its proper divisors (2730668210142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110011220002 is a wasteful number, since it uses less digits than its factorization.
2110011220002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185381694.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2110011220002 its reverse (2000221100112), we get a palindrome (4110232320114).
It can be divided in two parts, 21100112 and 20002, that multiplied together give a palindrome (422044440224).
The spelling of 2110011220002 in words is "two trillion, one hundred ten billion, eleven million, two hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •