Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …100010011111101010100 |
3 | 10221010010120201101120201 |
4 | 100021301310103331110 |
5 | 121141300320213022 |
6 | 2205533154110244 |
7 | 143124052452652 |
oct | 20116164237524 |
9 | 3833116641521 |
10 | 1110011101012 |
11 | 3988313683a0 |
12 | 15b16457b384 |
13 | 8089ab81498 |
14 | 3ba20cb9dd2 |
15 | 1dd19803127 |
hex | 10271d13f54 |
1110011101012 has 24 divisors (see below), whose sum is σ = 2119189030560. Its totient is φ = 504532184160.
The previous prime is 1110011100997. The next prime is 1110011101013. The reversal of 1110011101012 is 2101011100111.
It is a self number, because there is not a number n which added to its sum of digits gives 1110011101012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110011101013) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 807183 + ... + 1694569.
It is an arithmetic number, because the mean of its divisors is an integer number (88299542940).
Almost surely, 21110011101012 is an apocalyptic number.
It is an amenable number.
1110011101012 is a deficient number, since it is larger than the sum of its proper divisors (1009177929548).
1110011101012 is a wasteful number, since it uses less digits than its factorization.
1110011101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915831 (or 915829 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1110011101012 its reverse (2101011100111), we get a palindrome (3211022201123).
Subtracting 1110011101012 from its reverse (2101011100111), we obtain a palindrome (990999999099).
The spelling of 1110011101012 in words is "one trillion, one hundred ten billion, eleven million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •