Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …001111101111111110100 |
3 | 10221010002210211110020121 |
4 | 100021301021331333310 |
5 | 121141240000013022 |
6 | 2205532120141324 |
7 | 143123556222310 |
oct | 20116111757764 |
9 | 3833083743217 |
10 | 1110000001012 |
11 | 398826076841 |
12 | 15b160907844 |
13 | 80898796036 |
14 | 3ba1d62ab40 |
15 | 1dd1885e2c7 |
hex | 1027127dff4 |
1110000001012 has 24 divisors (see below), whose sum is σ = 2221895883200. Its totient is φ = 475308025920.
The previous prime is 1110000000997. The next prime is 1110000001039. The reversal of 1110000001012 is 2101000000111.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 1110000000986 and 1110000001004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16894137 + ... + 16959712.
Almost surely, 21110000001012 is an apocalyptic number.
It is an amenable number.
1110000001012 is an abundant number, since it is smaller than the sum of its proper divisors (1111895882188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110000001012 is a wasteful number, since it uses less digits than its factorization.
1110000001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33855031 (or 33855029 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1110000001012 its reverse (2101000000111), we get a palindrome (3211000001123).
Subtracting 1110000001012 from its reverse (2101000000111), we obtain a palindrome (990999999099).
The spelling of 1110000001012 in words is "one trillion, one hundred ten billion, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •