Base | Representation |
---|---|
bin | 10000010011000101111… |
… | …011001000110010100010 |
3 | 10222001221120101100011102 |
4 | 100103011323020302202 |
5 | 121322241100023020 |
6 | 2214305414314402 |
7 | 143626641602342 |
oct | 20230573106242 |
9 | 3861846340142 |
10 | 1120012111010 |
11 | 3a1aa3702211 |
12 | 161095958a02 |
13 | 81802b33590 |
14 | 3c2cd222d22 |
15 | 1e202810475 |
hex | 104c5ec8ca2 |
1120012111010 has 32 divisors (see below), whose sum is σ = 2171167114032. Its totient is φ = 413530225920.
The previous prime is 1120012111007. The next prime is 1120012111027. The reversal of 1120012111010 is 101112100211.
It can be written as a sum of positive squares in 8 ways, for example, as 851738872609 + 268273238401 = 922897^2 + 517951^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1120012110982 and 1120012111000.
It is an unprimeable number.
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, 4826240 + ... + 5052980.
Almost surely, 21120012111010 is an apocalyptic number.
1120012111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1120012111010 is a deficient number, since it is larger than the sum of its proper divisors (1051155003022).
1120012111010 is a wasteful number, since it uses less digits than its factorization.
1120012111010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264758.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1120012111010 its reverse (101112100211), we get a palindrome (1221124211221).
The spelling of 1120012111010 in words is "one trillion, one hundred twenty billion, twelve million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •