Base | Representation |
---|---|
bin | 10000001011101000111… |
… | …101111011010100000010 |
3 | 10221022021220012120200102 |
4 | 100023220331323110002 |
5 | 121204344042011320 |
6 | 2210503403522402 |
7 | 143224434660056 |
oct | 20135075732402 |
9 | 3838256176612 |
10 | 1112010110210 |
11 | 39966779860a |
12 | 15b621b29402 |
13 | 80b2906c86c |
14 | 3bb70597c66 |
15 | 1ddd506c175 |
hex | 102e8f7b502 |
1112010110210 has 32 divisors (see below), whose sum is σ = 2050635155184. Its totient is φ = 433913472000.
The previous prime is 1112010110161. The next prime is 1112010110243. The reversal of 1112010110210 is 120110102111.
It can be written as a sum of positive squares in 8 ways, for example, as 245790867529 + 866219242681 = 495773^2 + 930709^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1112010110191 and 1112010110200.
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, 4328150 + ... + 4577870.
Almost surely, 21112010110210 is an apocalyptic number.
1112010110210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1112010110210 is a deficient number, since it is larger than the sum of its proper divisors (938625044974).
1112010110210 is a wasteful number, since it uses less digits than its factorization.
1112010110210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260630.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1112010110210 its reverse (120110102111), we get a palindrome (1232120212321).
The spelling of 1112010110210 in words is "one trillion, one hundred twelve billion, ten million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •