Base | Representation |
---|---|
bin | 100010000111100110001110… |
… | …1010010001001010110000100 |
3 | 1110100121100210200001122211020 |
4 | 1010033030131102021112010 |
5 | 303314011001230313012 |
6 | 2542141124152111140 |
7 | 120133220361315432 |
oct | 10417143522112604 |
9 | 1410540720048736 |
10 | 300111331104132 |
11 | 87696556581899 |
12 | 297ab7056954b0 |
13 | cb5c4b960a3b2 |
14 | 5417674715d52 |
15 | 24a68b773ca8c |
hex | 110f31d489584 |
300111331104132 has 12 divisors (see below), whose sum is σ = 700259772576336. Its totient is φ = 100037110368040.
The previous prime is 300111331104089. The next prime is 300111331104251. The reversal of 300111331104132 is 231401133111003.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×3001113311041322 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12504638795994 + ... + 12504638796017.
It is an arithmetic number, because the mean of its divisors is an integer number (58354981048028).
Almost surely, 2300111331104132 is an apocalyptic number.
It is an amenable number.
300111331104132 is an abundant number, since it is smaller than the sum of its proper divisors (400148441472204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300111331104132 is a wasteful number, since it uses less digits than its factorization.
300111331104132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25009277592018 (or 25009277592016 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 300111331104132 its reverse (231401133111003), we get a palindrome (531512464215135).
The spelling of 300111331104132 in words is "three hundred trillion, one hundred eleven billion, three hundred thirty-one million, one hundred four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •