Base | Representation |
---|---|
bin | 1101101100101100101101… |
… | …00001111101000100001011 |
3 | 10221122202001210122021000220 |
4 | 12312112112201331010023 |
5 | 12422014133032130443 |
6 | 144022213030401123 |
7 | 6226216161622653 |
oct | 666262641750413 |
9 | 127582053567026 |
10 | 30123131130123 |
11 | 966416a23a619 |
12 | 34660938001a3 |
13 | 13a67a3230b25 |
14 | 761d784b1363 |
15 | 373889ac6a83 |
hex | 1b659687d10b |
30123131130123 has 32 divisors (see below), whose sum is σ = 42297229209600. Its totient is φ = 19016519851296.
The previous prime is 30123131130101. The next prime is 30123131130133. The reversal of 30123131130123 is 32103113132103.
It is not a de Polignac number, because 30123131130123 - 212 = 30123131126027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30123131130093 and 30123131130102.
It is not an unprimeable number, because it can be changed into a prime (30123131130133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1818252786 + ... + 1818269352.
It is an arithmetic number, because the mean of its divisors is an integer number (1321788412800).
Almost surely, 230123131130123 is an apocalyptic number.
30123131130123 is a deficient number, since it is larger than the sum of its proper divisors (12174098079477).
30123131130123 is a wasteful number, since it uses less digits than its factorization.
30123131130123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29111.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 30123131130123 its reverse (32103113132103), we get a palindrome (62226244262226).
The spelling of 30123131130123 in words is "thirty trillion, one hundred twenty-three billion, one hundred thirty-one million, one hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •