Base | Representation |
---|---|
bin | 1101101111010010011110… |
… | …11101111010000010100001 |
3 | 10221222020210111201212102112 |
4 | 12313221033131322002201 |
5 | 12424443422044400113 |
6 | 144131132401525105 |
7 | 6235516553006231 |
oct | 667511735720241 |
9 | 127866714655375 |
10 | 30212133200033 |
11 | 9698991620aa4 |
12 | 347b392343795 |
13 | 13b1cb838c115 |
14 | 7663bca3dcc1 |
15 | 375d485305a8 |
hex | 1b7a4f77a0a1 |
30212133200033 has 8 divisors (see below), whose sum is σ = 30356197304736. Its totient is φ = 30068077384800.
The previous prime is 30212133200023. The next prime is 30212133200069. The reversal of 30212133200033 is 33000233121203.
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 30212133200033 - 214 = 30212133183649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30212133199981 and 30212133200008.
It is not an unprimeable number, because it can be changed into a prime (30212133200023) 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, 5296610 + ... + 9406292.
It is an arithmetic number, because the mean of its divisors is an integer number (3794524663092).
Almost surely, 230212133200033 is an apocalyptic number.
It is an amenable number.
30212133200033 is a deficient number, since it is larger than the sum of its proper divisors (144064104703).
30212133200033 is a wasteful number, since it uses less digits than its factorization.
30212133200033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4144735.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 30212133200033 its reverse (33000233121203), we get a palindrome (63212366321236).
The spelling of 30212133200033 in words is "thirty trillion, two hundred twelve billion, one hundred thirty-three million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •