Base | Representation |
---|---|
bin | 11100000100000100… |
… | …011000110110011101 |
3 | 2212210000121112122022 |
4 | 130010010120312131 |
5 | 443203023432201 |
6 | 21502023225525 |
7 | 2114503350203 |
oct | 340404306635 |
9 | 85700545568 |
10 | 30133030301 |
11 | 11863345730 |
12 | 5a0b5a82a5 |
13 | 2ac2b01c5a |
14 | 165bd97073 |
15 | bb565541b |
hex | 704118d9d |
30133030301 has 8 divisors (see below), whose sum is σ = 33322704384. Its totient is φ = 27018407520.
The previous prime is 30133030217. The next prime is 30133030303. The reversal of 30133030301 is 10303033103.
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-30133030301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30133030301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30133030303) 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, 18761981 + ... + 18763586.
It is an arithmetic number, because the mean of its divisors is an integer number (4165338048).
Almost surely, 230133030301 is an apocalyptic number.
It is an amenable number.
30133030301 is a deficient number, since it is larger than the sum of its proper divisors (3189674083).
30133030301 is a wasteful number, since it uses less digits than its factorization.
30133030301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37525651.
The product of its (nonzero) digits is 243, while the sum is 17.
Adding to 30133030301 its reverse (10303033103), we get a palindrome (40436063404).
It can be divided in two parts, 30 and 133030301, that added together give a palindrome (133030331).
The spelling of 30133030301 in words is "thirty billion, one hundred thirty-three million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •