Base | Representation |
---|---|
bin | 1101101100111011101111… |
… | …00011010100101110111110 |
3 | 10221200111220020010220012201 |
4 | 12312131313203110232332 |
5 | 12422132200020030420 |
6 | 144030025515022114 |
7 | 6226623154321546 |
oct | 666356743245676 |
9 | 127614806126181 |
10 | 30131201330110 |
11 | 96676306a5291 |
12 | 346776643a93a |
13 | 13a748b1827aa |
14 | 762502210326 |
15 | 373bad33c10a |
hex | 1b67778d4bbe |
30131201330110 has 8 divisors (see below), whose sum is σ = 54236162394216. Its totient is φ = 12052480532040.
The previous prime is 30131201330081. The next prime is 30131201330119. The reversal of 30131201330110 is 1103310213103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×301312013301102 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30131201330119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1506560066496 + ... + 1506560066515.
It is an arithmetic number, because the mean of its divisors is an integer number (6779520299277).
Almost surely, 230131201330110 is an apocalyptic number.
30131201330110 is a deficient number, since it is larger than the sum of its proper divisors (24104961064106).
30131201330110 is a wasteful number, since it uses less digits than its factorization.
30131201330110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3013120133018.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30131201330110 its reverse (1103310213103), we get a palindrome (31234511543213).
The spelling of 30131201330110 in words is "thirty trillion, one hundred thirty-one billion, two hundred one million, three hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •