Base | Representation |
---|---|
bin | 11100000100000101… |
… | …110100101110001110 |
3 | 2212210001022122211112 |
4 | 130010011310232032 |
5 | 443203123002411 |
6 | 21502035252022 |
7 | 2114506505252 |
oct | 340405645616 |
9 | 85701278745 |
10 | 30133406606 |
11 | 11863582426 |
12 | 5a0b74a012 |
13 | 2ac2c04314 |
14 | 165c054262 |
15 | bb56cbb8b |
hex | 704174b8e |
30133406606 has 4 divisors (see below), whose sum is σ = 45200109912. Its totient is φ = 15066703302.
The previous prime is 30133406603. The next prime is 30133406609. The reversal of 30133406606 is 60660433103.
30133406606 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 60660433103 = 199 ⋅304826297.
It is an interprime number because it is at equal distance from previous prime (30133406603) and next prime (30133406609).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30133406603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7533351650 + ... + 7533351653.
It is an arithmetic number, because the mean of its divisors is an integer number (11300027478).
Almost surely, 230133406606 is an apocalyptic number.
30133406606 is a deficient number, since it is larger than the sum of its proper divisors (15066703306).
30133406606 is a wasteful number, since it uses less digits than its factorization.
30133406606 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15066703305.
The product of its (nonzero) digits is 23328, while the sum is 32.
Adding to 30133406606 its reverse (60660433103), we get a palindrome (90793839709).
The spelling of 30133406606 in words is "thirty billion, one hundred thirty-three million, four hundred six thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •