Base | Representation |
---|---|
bin | 1101101111100011001111… |
… | …11001100010111010011001 |
3 | 10222000010000201111202110122 |
4 | 12313301213321202322121 |
5 | 12430120340024024423 |
6 | 144135221415323025 |
7 | 6236255564223521 |
oct | 667614771427231 |
9 | 128003021452418 |
10 | 30221133033113 |
11 | 96a178a808880 |
12 | 3481084380475 |
13 | 13b2ac0ab1439 |
14 | 7669d4010681 |
15 | 3761c36c78c8 |
hex | 1b7c67e62e99 |
30221133033113 has 8 divisors (see below), whose sum is σ = 32970403605216. Its totient is φ = 27472178268000.
The previous prime is 30221133033037. The next prime is 30221133033121. The reversal of 30221133033113 is 31133033112203.
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 30221133033113 - 216 = 30221132967577 is a prime.
It is a super-2 number, since 2×302211330331132 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30221133033613) 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, 78751631 + ... + 79134452.
It is an arithmetic number, because the mean of its divisors is an integer number (4121300450652).
Almost surely, 230221133033113 is an apocalyptic number.
It is an amenable number.
30221133033113 is a deficient number, since it is larger than the sum of its proper divisors (2749270572103).
30221133033113 is a wasteful number, since it uses less digits than its factorization.
30221133033113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157903495.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 30221133033113 its reverse (31133033112203), we get a palindrome (61354166145316).
The spelling of 30221133033113 in words is "thirty trillion, two hundred twenty-one billion, one hundred thirty-three million, thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •