Base | Representation |
---|---|
bin | 100001000101001… |
… | …0100000110001100 |
3 | 2212100122211202120 |
4 | 1002022110012030 |
5 | 4233130000022 |
6 | 302051052540 |
7 | 36335562432 |
oct | 10212240614 |
9 | 2770584676 |
10 | 1110000012 |
11 | 51a625490 |
12 | 26b8a1150 |
13 | 148c72554 |
14 | a75c2d52 |
15 | 676add5c |
hex | 4229418c |
1110000012 has 48 divisors (see below), whose sum is σ = 2916609024. Its totient is φ = 325512000.
The previous prime is 1109999993. The next prime is 1110000019. The reversal of 1110000012 is 2100000111.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is not an unprimeable number, because it can be changed into a prime (1110000019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131539 + ... + 139722.
It is an arithmetic number, because the mean of its divisors is an integer number (60762688).
Almost surely, 21110000012 is an apocalyptic number.
1110000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1110000012 is an abundant number, since it is smaller than the sum of its proper divisors (1806609012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110000012 is a wasteful number, since it uses less digits than its factorization.
1110000012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271310 (or 271308 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
The square root of 1110000012 is about 33316.6626780054. The cubic root of 1110000012 is about 1035.3988091796.
Adding to 1110000012 its reverse (2100000111), we get a palindrome (3210000123).
Subtracting 1110000012 from its reverse (2100000111), we obtain a palindrome (990000099).
The spelling of 1110000012 in words is "one billion, one hundred ten million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •