Base | Representation |
---|---|
bin | 1101101001111111101000… |
… | …00011110101010110110101 |
3 | 10221022212020001001011221021 |
4 | 12310333310003311112311 |
5 | 12414003333004341041 |
6 | 143511404414021141 |
7 | 6216416423635363 |
oct | 664776403652665 |
9 | 127285201034837 |
10 | 30030211012021 |
11 | 9628817259590 |
12 | 3450080aa77b1 |
13 | 139aab5445a1c |
14 | 75b681842633 |
15 | 37124c1d4cd1 |
hex | 1b4ff40f55b5 |
30030211012021 has 8 divisors (see below), whose sum is σ = 32765148489888. Its totient is φ = 27296093250000.
The previous prime is 30030211011971. The next prime is 30030211012037. The reversal of 30030211012021 is 12021011203003.
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 30030211012021 - 211 = 30030211009973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30030211011986 and 30030211012004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30030211042021) 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, 204852355 + ... + 204998896.
It is an arithmetic number, because the mean of its divisors is an integer number (4095643561236).
Almost surely, 230030211012021 is an apocalyptic number.
It is an amenable number.
30030211012021 is a deficient number, since it is larger than the sum of its proper divisors (2734937477867).
30030211012021 is a wasteful number, since it uses less digits than its factorization.
30030211012021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409857923.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 30030211012021 its reverse (12021011203003), we get a palindrome (42051222215024).
The spelling of 30030211012021 in words is "thirty trillion, thirty billion, two hundred eleven million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •