Base | Representation |
---|---|
bin | 1010010011100100000111… |
… | …1101010111100010101100 |
3 | 1111010020212220222000011020 |
4 | 2210321001331113202230 |
5 | 2441122324431124400 |
6 | 40033254555054140 |
7 | 2246440310436546 |
oct | 244710175274254 |
9 | 44106786860136 |
10 | 11331230333100 |
11 | 3679603133757 |
12 | 133009a141350 |
13 | 6426b849c9b2 |
14 | 2b26122aa696 |
15 | 149b409c02a0 |
hex | a4e41f578ac |
11331230333100 has 36 divisors (see below), whose sum is σ = 32785026431304. Its totient is φ = 3021661422080.
The previous prime is 11331230333083. The next prime is 11331230333257. The reversal of 11331230333100 is 133303213311.
11331230333100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×113312303331002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18885383589 + ... + 18885384188.
Almost surely, 211331230333100 is an apocalyptic number.
11331230333100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11331230333100 is an abundant number, since it is smaller than the sum of its proper divisors (21453796098204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331230333100 is a wasteful number, since it uses less digits than its factorization.
11331230333100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37770767794 (or 37770767787 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 11331230333100 its reverse (133303213311), we get a palindrome (11464533546411).
The spelling of 11331230333100 in words is "eleven trillion, three hundred thirty-one billion, two hundred thirty million, three hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •