Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …011110110001100100010 |
3 | 10221010102011200121110002 |
4 | 100021320103312030202 |
5 | 121142011211443020 |
6 | 2205552044540002 |
7 | 143126544400064 |
oct | 20117023661442 |
9 | 3833364617402 |
10 | 1110120031010 |
11 | 3988878a9091 |
12 | 15b194b51602 |
13 | 808b76007c3 |
14 | 3ba31553734 |
15 | 1dd2416d975 |
hex | 102784f6322 |
1110120031010 has 32 divisors (see below), whose sum is σ = 2016271699200. Its totient is φ = 440045082880.
The previous prime is 1110120030983. The next prime is 1110120031081. The reversal of 1110120031010 is 101300210111.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1110120030982 and 1110120031000.
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, 352586 + ... + 1531194.
It is an arithmetic number, because the mean of its divisors is an integer number (63008490600).
Almost surely, 21110120031010 is an apocalyptic number.
1110120031010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110120031010 is a deficient number, since it is larger than the sum of its proper divisors (906151668190).
1110120031010 is a wasteful number, since it uses less digits than its factorization.
1110120031010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1179466.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1110120031010 its reverse (101300210111), we get a palindrome (1211420241121).
The spelling of 1110120031010 in words is "one trillion, one hundred ten billion, one hundred twenty million, thirty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •