Base | Representation |
---|---|
bin | 1101101001011111110000… |
… | …01110011011101010001111 |
3 | 10221021020001121121001002121 |
4 | 12310233320032123222033 |
5 | 12413213312330430111 |
6 | 143455454523433411 |
7 | 6215242423326100 |
oct | 664577016335217 |
9 | 127236047531077 |
10 | 30013101030031 |
11 | 96215371008a9 |
12 | 34488a6985867 |
13 | 13992b9725522 |
14 | 75a8db2d43a7 |
15 | 370a9a035871 |
hex | 1b4bf839ba8f |
30013101030031 has 24 divisors (see below), whose sum is σ = 35770101822000. Its totient is φ = 25094301321600.
The previous prime is 30013101030013. The next prime is 30013101030037. The reversal of 30013101030031 is 13003010131003.
It is not a de Polignac number, because 30013101030031 - 29 = 30013101029519 is a prime.
It is a super-2 number, since 2×300131010300312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30013101029987 and 30013101030014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30013101030037) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12325845 + ... + 14558593.
It is an arithmetic number, because the mean of its divisors is an integer number (1490420909250).
Almost surely, 230013101030031 is an apocalyptic number.
30013101030031 is a deficient number, since it is larger than the sum of its proper divisors (5757000791969).
30013101030031 is a wasteful number, since it uses less digits than its factorization.
30013101030031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2239495 (or 2239488 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 30013101030031 its reverse (13003010131003), we get a palindrome (43016111161034).
The spelling of 30013101030031 in words is "thirty trillion, thirteen billion, one hundred one million, thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •