Base | Representation |
---|---|
bin | 1100000111111110010011… |
… | …0110100101010000001100 |
3 | 1202012102221212220110012020 |
4 | 3001333210312211100030 |
5 | 3221404114444024400 |
6 | 44204122224210140 |
7 | 2544066441056625 |
oct | 301774466452014 |
9 | 52172855813166 |
10 | 13331123033100 |
11 | 427a774457454 |
12 | 15b37b2169950 |
13 | 759172735932 |
14 | 3413307c8a4c |
15 | 181b8e3552a0 |
hex | c1fe4da540c |
13331123033100 has 72 divisors (see below), whose sum is σ = 38580071790288. Its totient is φ = 3554165299200.
The previous prime is 13331123033069. The next prime is 13331123033131. The reversal of 13331123033100 is 133032113331.
It is an interprime number because it is at equal distance from previous prime (13331123033069) and next prime (13331123033131).
It is a super-2 number, since 2×133311230331002 (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 23 ways as a sum of consecutive naturals, for example, 3670749 + ... + 6335348.
Almost surely, 213331123033100 is an apocalyptic number.
13331123033100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13331123033100 is an abundant number, since it is smaller than the sum of its proper divisors (25248948757188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13331123033100 is a wasteful number, since it uses less digits than its factorization.
13331123033100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10010555 (or 10010548 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 13331123033100 its reverse (133032113331), we get a palindrome (13464155146431).
The spelling of 13331123033100 in words is "thirteen trillion, three hundred thirty-one billion, one hundred twenty-three million, thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •