Base | Representation |
---|---|
bin | 1010000000010101111010… |
… | …1101000000000100111000 |
3 | 1102221200111121112000210210 |
4 | 2200011132231000010320 |
5 | 2420220022011201102 |
6 | 35221442323111120 |
7 | 2213540015662236 |
oct | 240053655000470 |
9 | 42850447460723 |
10 | 11001000100152 |
11 | 3561552840a67 |
12 | 12980988124a0 |
13 | 61a50b6979aa |
14 | 2a064630b956 |
15 | 1412643aa36c |
hex | a015eb40138 |
11001000100152 has 32 divisors (see below), whose sum is σ = 27566016443280. Its totient is φ = 3658531207680.
The previous prime is 11001000100151. The next prime is 11001000100159. The reversal of 11001000100152 is 25100100010011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001000100151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 529290999 + ... + 529311782.
Almost surely, 211001000100152 is an apocalyptic number.
11001000100152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11001000100152 is an abundant number, since it is smaller than the sum of its proper divisors (16565016343128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001000100152 is a wasteful number, since it uses less digits than its factorization.
11001000100152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1058603223 (or 1058603219 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 12.
Adding to 11001000100152 its reverse (25100100010011), we get a palindrome (36101100110163).
The spelling of 11001000100152 in words is "eleven trillion, one billion, one hundred thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •