Base | Representation |
---|---|
bin | 1101101111010010101010… |
… | …00110001001000110010001 |
3 | 10221222021001002102120212022 |
4 | 12313221111012021012101 |
5 | 12424444120233233203 |
6 | 144131150013541225 |
7 | 6235522110455510 |
oct | 667512506110621 |
9 | 127867032376768 |
10 | 30212227633553 |
11 | 9698a2a960329 |
12 | 347b3b9aa4815 |
13 | 13b2001b04044 |
14 | 7663cb3c2677 |
15 | 375d51985a38 |
hex | 1b7a55189191 |
30212227633553 has 8 divisors (see below), whose sum is σ = 34541255379072. Its totient is φ = 25886448694656.
The previous prime is 30212227633547. The next prime is 30212227633571. The reversal of 30212227633553 is 35533672221203.
It is a happy number.
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 30212227633553 - 224 = 30212210856337 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30212227603553) 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, 812181725 + ... + 812218922.
It is an arithmetic number, because the mean of its divisors is an integer number (4317656922384).
Almost surely, 230212227633553 is an apocalyptic number.
It is an amenable number.
30212227633553 is a deficient number, since it is larger than the sum of its proper divisors (4329027745519).
30212227633553 is a wasteful number, since it uses less digits than its factorization.
30212227633553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1624403311.
The product of its (nonzero) digits is 1360800, while the sum is 44.
Adding to 30212227633553 its reverse (35533672221203), we get a palindrome (65745899854756).
The spelling of 30212227633553 in words is "thirty trillion, two hundred twelve billion, two hundred twenty-seven million, six hundred thirty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •