Base | Representation |
---|---|
bin | 1010000000011101011110… |
… | …1100111101101001000000 |
3 | 1102221212202002101101210010 |
4 | 2200013113230331221000 |
5 | 2420233201203231222 |
6 | 35222420001504520 |
7 | 2213641225661250 |
oct | 240072754755100 |
9 | 42855662341703 |
10 | 11003030133312 |
11 | 35623a4730a18 |
12 | 1298564642140 |
13 | 61a773129149 |
14 | 2a0799b83960 |
15 | 14133270180c |
hex | a01d7b3da40 |
11003030133312 has 112 divisors (see below), whose sum is σ = 33271829937792. Its totient is φ = 3143650836480.
The previous prime is 11003030133257. The next prime is 11003030133323. The reversal of 11003030133312 is 21333103030011.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×110030301333122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92667262 + ... + 92785922.
Almost surely, 211003030133312 is an apocalyptic number.
11003030133312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11003030133312 is an abundant number, since it is smaller than the sum of its proper divisors (22268799804480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003030133312 is a wasteful number, since it uses less digits than its factorization.
11003030133312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187676 (or 187666 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11003030133312 its reverse (21333103030011), we get a palindrome (32336133163323).
The spelling of 11003030133312 in words is "eleven trillion, three billion, thirty million, one hundred thirty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •