Base | Representation |
---|---|
bin | 10000001001110111000… |
… | …111110110101010111100 |
3 | 10221010100210012111222100 |
4 | 100021313013312222330 |
5 | 121141441112010022 |
6 | 2205550053545100 |
7 | 143126213150265 |
oct | 20116707665274 |
9 | 3833323174870 |
10 | 1110100110012 |
11 | 398877632153 |
12 | 15b18a345190 |
13 | 808b344732a |
14 | 3ba2ca4996c |
15 | 1dd225361ac |
hex | 102771f6abc |
1110100110012 has 72 divisors (see below), whose sum is σ = 2882167560272. Its totient is φ = 360002361600.
The previous prime is 1110100109903. The next prime is 1110100110059. The reversal of 1110100110012 is 2100110010111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1110100109976 and 1110100110003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20393712 + ... + 20448072.
Almost surely, 21110100110012 is an apocalyptic number.
1110100110012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1110100110012 is an abundant number, since it is smaller than the sum of its proper divisors (1772067450260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110100110012 is a wasteful number, since it uses less digits than its factorization.
1110100110012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69739 (or 69734 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1110100110012 its reverse (2100110010111), we get a palindrome (3210210120123).
Subtracting 1110100110012 from its reverse (2100110010111), we obtain a palindrome (990009900099).
The spelling of 1110100110012 in words is "one trillion, one hundred ten billion, one hundred million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •