Base | Representation |
---|---|
bin | 11100001110001001… |
… | …000101010110110101 |
3 | 2220012210121210012212 |
4 | 130032021011112311 |
5 | 444024310031313 |
6 | 21530501423205 |
7 | 2121625014335 |
oct | 341611052665 |
9 | 86183553185 |
10 | 30302033333 |
11 | 1193a787160 |
12 | 5a5810ab05 |
13 | 2b1bb25550 |
14 | 16765cb0c5 |
15 | bc53da3a8 |
hex | 70e2455b5 |
30302033333 has 32 divisors (see below), whose sum is σ = 37770147072. Its totient is φ = 23883955200.
The previous prime is 30302033269. The next prime is 30302033339. The reversal of 30302033333 is 33333020303.
It is a cyclic number.
It is not a de Polignac number, because 30302033333 - 26 = 30302033269 is a prime.
It is a super-2 number, since 2×303020333332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30302033299 and 30302033308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30302033339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1210403 + ... + 1235183.
It is an arithmetic number, because the mean of its divisors is an integer number (1180317096).
Almost surely, 230302033333 is an apocalyptic number.
It is an amenable number.
30302033333 is a deficient number, since it is larger than the sum of its proper divisors (7468113739).
30302033333 is a wasteful number, since it uses less digits than its factorization.
30302033333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25325.
The product of its (nonzero) digits is 4374, while the sum is 23.
Adding to 30302033333 its reverse (33333020303), we get a palindrome (63635053636).
The spelling of 30302033333 in words is "thirty billion, three hundred two million, thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •