Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …01101100000110011000 |
3 | 10112121011201122001202011 |
4 | 32203110221230012120 |
5 | 112341000012023000 |
6 | 2043221012515304 |
7 | 132150635460442 |
oct | 16432451540630 |
9 | 3477151561664 |
10 | 1000000111000 |
11 | 356108aa1330 |
12 | 14198201bb34 |
13 | 733b8307217 |
14 | 36586475492 |
15 | 1b02b7892ba |
hex | e8d4a6c198 |
1000000111000 has 64 divisors (see below), whose sum is σ = 2552727584160. Its totient is φ = 363636400000.
The previous prime is 1000000110983. The next prime is 1000000111001. The reversal of 1000000111000 is 1110000001.
It is a Harshad number since it is a multiple of its sum of digits (4).
1000000111000 is a modest number, since divided by 111000 gives 1000 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000000111001) 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, 45443551 + ... + 45465550.
Almost surely, 21000000111000 is an apocalyptic number.
1000000111000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000000111000 is an abundant number, since it is smaller than the sum of its proper divisors (1552727473160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000000111000 is a wasteful number, since it uses less digits than its factorization.
1000000111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90909133 (or 90909119 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 1000000111000 its reverse (1110000001), we get a palindrome (1001110111001).
It can be divided in two parts, 10000001 and 11000, that added together give a palindrome (10011001).
The spelling of 1000000111000 in words is "one trillion, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •