Base | Representation |
---|---|
bin | 11100001111111111… |
… | …010010101101100111 |
3 | 2220021221221010100101 |
4 | 130033333102231213 |
5 | 444110223133111 |
6 | 21533525524531 |
7 | 2122452265435 |
oct | 341777225547 |
9 | 86257833311 |
10 | 30333021031 |
11 | 11956221725 |
12 | 5a66573747 |
13 | 2b25384c71 |
14 | 167a775d55 |
15 | bc7eabbc1 |
hex | 70ffd2b67 |
30333021031 has 2 divisors, whose sum is σ = 30333021032. Its totient is φ = 30333021030.
The previous prime is 30333021013. The next prime is 30333021113. The reversal of 30333021031 is 13012033303.
Together with previous prime (30333021013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (13012033303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30333021031 - 213 = 30333012839 is a prime.
It is a super-2 number, since 2×303330210312 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30333021331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15166510515 + 15166510516.
It is an arithmetic number, because the mean of its divisors is an integer number (15166510516).
Almost surely, 230333021031 is an apocalyptic number.
30333021031 is a deficient number, since it is larger than the sum of its proper divisors (1).
30333021031 is an equidigital number, since it uses as much as digits as its factorization.
30333021031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 30333021031 its reverse (13012033303), we get a palindrome (43345054334).
The spelling of 30333021031 in words is "thirty billion, three hundred thirty-three million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •