Base | Representation |
---|---|
bin | 1101101001000111011010… |
… | …10001010011110100111001 |
3 | 10221012222022211112110011211 |
4 | 12310203231101103310321 |
5 | 12413010031234124423 |
6 | 143445454040123121 |
7 | 6214300524252643 |
oct | 664435521236471 |
9 | 127188284473154 |
10 | 30000032333113 |
11 | 9616a40175437 |
12 | 344625a1664a1 |
13 | 1397cb605017b |
14 | 75a01b7a5893 |
15 | 370582a6410d |
hex | 1b48ed453d39 |
30000032333113 has 8 divisors (see below), whose sum is σ = 30640611006720. Its totient is φ = 29359548664320.
The previous prime is 30000032333107. The next prime is 30000032333119. The reversal of 30000032333113 is 31133323000003.
It is an interprime number because it is at equal distance from previous prime (30000032333107) and next prime (30000032333119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30000032333113 - 25 = 30000032333081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30000032333119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23112733 + ... + 24376186.
It is an arithmetic number, because the mean of its divisors is an integer number (3830076375840).
Almost surely, 230000032333113 is an apocalyptic number.
It is an amenable number.
30000032333113 is a deficient number, since it is larger than the sum of its proper divisors (640578673607).
30000032333113 is a wasteful number, since it uses less digits than its factorization.
30000032333113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47502407.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 30000032333113 its reverse (31133323000003), we get a palindrome (61133355333116).
The spelling of 30000032333113 in words is "thirty trillion, thirty-two million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •