Base | Representation |
---|---|
bin | 10000001011101110011… |
… | …100100000010100110010 |
3 | 10221022112022010200112012 |
4 | 100023232130200110302 |
5 | 121210041103342320 |
6 | 2210520445402522 |
7 | 143226632063660 |
oct | 20135634402462 |
9 | 3838468120465 |
10 | 1112102012210 |
11 | 399704658982 |
12 | 15b648869442 |
13 | 80b42109447 |
14 | 3bb7c87bc30 |
15 | 1dddd1724c5 |
hex | 102ee720532 |
1112102012210 has 16 divisors (see below), whose sum is σ = 2287752710976. Its totient is φ = 381292118448.
The previous prime is 1112102012183. The next prime is 1112102012213. The reversal of 1112102012210 is 122102012111.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1112102012213) 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 7 ways as a sum of consecutive naturals, for example, 7943585732 + ... + 7943585871.
It is an arithmetic number, because the mean of its divisors is an integer number (142984544436).
Almost surely, 21112102012210 is an apocalyptic number.
1112102012210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1112102012210 is an abundant number, since it is smaller than the sum of its proper divisors (1175650698766).
1112102012210 is a wasteful number, since it uses less digits than its factorization.
1112102012210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15887171617.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1112102012210 its reverse (122102012111), we get a palindrome (1234204024321).
Subtracting from 1112102012210 its reverse (122102012111), we obtain a palindrome (990000000099).
The spelling of 1112102012210 in words is "one trillion, one hundred twelve billion, one hundred two million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •