Base | Representation |
---|---|
bin | 1101101001101100100111… |
… | …00100010100011001100001 |
3 | 10221021212212120100222000002 |
4 | 12310312103210110121201 |
5 | 12413321431031000413 |
6 | 143502555411505345 |
7 | 6215605432330430 |
oct | 664662344243141 |
9 | 127255776328002 |
10 | 30020002203233 |
11 | 9624458695429 |
12 | 344a0b1bb8255 |
13 | 1399b49408973 |
14 | 75ad93a87117 |
15 | 370d50d2c958 |
hex | 1b4d93914661 |
30020002203233 has 8 divisors (see below), whose sum is σ = 34309841424768. Its totient is φ = 25730479851264.
The previous prime is 30020002203227. The next prime is 30020002203281. The reversal of 30020002203233 is 33230220002003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30020002203233 is a prime.
It is a super-2 number, since 2×300200022032332 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30020002203293) 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, 79014341 + ... + 79393362.
It is an arithmetic number, because the mean of its divisors is an integer number (4288730178096).
Almost surely, 230020002203233 is an apocalyptic number.
It is an amenable number.
30020002203233 is a deficient number, since it is larger than the sum of its proper divisors (4289839221535).
30020002203233 is a wasteful number, since it uses less digits than its factorization.
30020002203233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158434783.
The product of its (nonzero) digits is 1296, while the sum is 20.
Adding to 30020002203233 its reverse (33230220002003), we get a palindrome (63250222205236).
The spelling of 30020002203233 in words is "thirty trillion, twenty billion, two million, two hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •