Base | Representation |
---|---|
bin | 1101101001001011011110… |
… | …00100111010101001011101 |
3 | 10221020011221121102121100211 |
4 | 12310211233010322221131 |
5 | 12413024011242403313 |
6 | 143450454113452421 |
7 | 6214405510204441 |
oct | 664455704725135 |
9 | 127204847377324 |
10 | 30002210122333 |
11 | 9617958504739 |
12 | 3446767571111 |
13 | 13982722a6047 |
14 | 75a186b00821 |
15 | 37065dd44e3d |
hex | 1b496f13aa5d |
30002210122333 has 8 divisors (see below), whose sum is σ = 32017180234752. Its totient is φ = 28015032701376.
The previous prime is 30002210122327. The next prime is 30002210122337. The reversal of 30002210122333 is 33322101220003.
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 30002210122333 - 25 = 30002210122301 is a prime.
It is a super-2 number, since 2×300022101223332 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30002210122337) 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, 6948170635 + ... + 6948174952.
It is an arithmetic number, because the mean of its divisors is an integer number (4002147529344).
Almost surely, 230002210122333 is an apocalyptic number.
It is an amenable number.
30002210122333 is a deficient number, since it is larger than the sum of its proper divisors (2014970112419).
30002210122333 is a wasteful number, since it uses less digits than its factorization.
30002210122333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13896345731.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 30002210122333 its reverse (33322101220003), we get a palindrome (63324311342336).
The spelling of 30002210122333 in words is "thirty trillion, two billion, two hundred ten million, one hundred twenty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •