Base | Representation |
---|---|
bin | 10000000001100101001… |
… | …111001110111110110000 |
3 | 10220021102020010020110011 |
4 | 100001211033032332300 |
5 | 121020234242320422 |
6 | 2201520002344304 |
7 | 142363004402344 |
oct | 20014517167660 |
9 | 3807366106404 |
10 | 1101210120112 |
11 | 39502544a163 |
12 | 15950905b094 |
13 | 7cac7703b8b |
14 | 3b4280ad624 |
15 | 1d9a1d3a077 |
hex | 100653cefb0 |
1101210120112 has 20 divisors (see below), whose sum is σ = 2133618361560. Its totient is φ = 550598930048.
The previous prime is 1101210120089. The next prime is 1101210120119. The reversal of 1101210120112 is 2110210121011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1101210120092 and 1101210120101.
It is not an unprimeable number, because it can be changed into a prime (1101210120119) 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 3 ways as a sum of consecutive naturals, for example, 1331439 + ... + 1993777.
It is an arithmetic number, because the mean of its divisors is an integer number (106680918078).
Almost surely, 21101210120112 is an apocalyptic number.
It is an amenable number.
1101210120112 is a deficient number, since it is larger than the sum of its proper divisors (1032408241448).
1101210120112 is a wasteful number, since it uses less digits than its factorization.
1101210120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766260 (or 766254 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1101210120112 its reverse (2110210121011), we get a palindrome (3211420241123).
The spelling of 1101210120112 in words is "one trillion, one hundred one billion, two hundred ten million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •