Base | Representation |
---|---|
bin | 1101101010000001010110… |
… | …00001011001101000001001 |
3 | 10221022221121022011011200220 |
4 | 12311000223001121220021 |
5 | 12414012230034333113 |
6 | 143512040114020253 |
7 | 6216451321506012 |
oct | 665005301315011 |
9 | 127287538134626 |
10 | 30031133121033 |
11 | 962914a811750 |
12 | 3450299877689 |
13 | 139ac014b0765 |
14 | 75b72c0b6009 |
15 | 3712a312c523 |
hex | 1b502b059a09 |
30031133121033 has 16 divisors (see below), whose sum is σ = 43712650123200. Its totient is φ = 18187769262080.
The previous prime is 30031133121019. The next prime is 30031133121043. The reversal of 30031133121033 is 33012133113003.
It is not a de Polignac number, because 30031133121033 - 28 = 30031133120777 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30031133120994 and 30031133121012.
It is not an unprimeable number, because it can be changed into a prime (30031133121043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 322889748 + ... + 322982741.
It is an arithmetic number, because the mean of its divisors is an integer number (2732040632700).
Almost surely, 230031133121033 is an apocalyptic number.
30031133121033 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
30031133121033 is a deficient number, since it is larger than the sum of its proper divisors (13681517002167).
30031133121033 is a wasteful number, since it uses less digits than its factorization.
30031133121033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 645873912.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 30031133121033 its reverse (33012133113003), we get a palindrome (63043266234036).
The spelling of 30031133121033 in words is "thirty trillion, thirty-one billion, one hundred thirty-three million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •