Base | Representation |
---|---|
bin | 1101101100111011100101… |
… | …10010001100101001111100 |
3 | 10221200111200122122010122212 |
4 | 12312131302302030221330 |
5 | 12422132014030434400 |
6 | 144030013540355552 |
7 | 6226621163411351 |
oct | 666356262145174 |
9 | 127614618563585 |
10 | 30131121343100 |
11 | 966759a532918 |
12 | 34677436a5bb8 |
13 | 13a74777282bb |
14 | 7624d574c628 |
15 | 373ba62dc335 |
hex | 1b6772c8ca7c |
30131121343100 has 72 divisors (see below), whose sum is σ = 66023314914480. Its totient is φ = 11934831237120.
The previous prime is 30131121343049. The next prime is 30131121343153. The reversal of 30131121343100 is 134312113103.
It is a super-2 number, since 2×301311213431002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
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, 17682827 + ... + 19311773.
Almost surely, 230131121343100 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30131121343100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33011657457240).
30131121343100 is an abundant number, since it is smaller than the sum of its proper divisors (35892193571380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30131121343100 is a wasteful number, since it uses less digits than its factorization.
30131121343100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1630767 (or 1630760 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 30131121343100 its reverse (134312113103), we get a palindrome (30265433456203).
The spelling of 30131121343100 in words is "thirty trillion, one hundred thirty-one billion, one hundred twenty-one million, three hundred forty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •