Base | Representation |
---|---|
bin | 1101101100111100000000… |
… | …01000101001000000110111 |
3 | 10221200112021021002212020112 |
4 | 12312132000020221000313 |
5 | 12422132443401031411 |
6 | 144030052101253235 |
7 | 6226626553312145 |
oct | 666360010510067 |
9 | 127615237085215 |
10 | 30131345330231 |
11 | 96676a4a09752 |
12 | 34677a670421b |
13 | 13a74b1c60772 |
14 | 7625173b6595 |
15 | 373bbacd3b8b |
hex | 1b6780229037 |
30131345330231 has 64 divisors (see below), whose sum is σ = 32870545459200. Its totient is φ = 27563478598656.
The previous prime is 30131345330201. The next prime is 30131345330243. The reversal of 30131345330231 is 13203354313103.
It is not a de Polignac number, because 30131345330231 - 210 = 30131345329207 is a prime.
It is a super-2 number, since 2×301313453302312 (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 (30131345330201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2229797531 + ... + 2229811043.
It is an arithmetic number, because the mean of its divisors is an integer number (513602272800).
Almost surely, 230131345330231 is an apocalyptic number.
30131345330231 is a deficient number, since it is larger than the sum of its proper divisors (2739200128969).
30131345330231 is a wasteful number, since it uses less digits than its factorization.
30131345330231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14088.
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 30131345330231 its reverse (13203354313103), we get a palindrome (43334699643334).
The spelling of 30131345330231 in words is "thirty trillion, one hundred thirty-one billion, three hundred forty-five million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •