Base | Representation |
---|---|
bin | 11100001001111011… |
… | …010000111110010001 |
3 | 2220000212112021010002 |
4 | 130021323100332101 |
5 | 443403203131113 |
6 | 21515453415345 |
7 | 2120105553542 |
oct | 341173207621 |
9 | 86025467102 |
10 | 30231302033 |
11 | 11903866739 |
12 | 5a3849a555 |
13 | 2b0a28bbca |
14 | 166b0584c9 |
15 | bbe0b7c58 |
hex | 709ed0f91 |
30231302033 has 2 divisors, whose sum is σ = 30231302034. Its totient is φ = 30231302032.
The previous prime is 30231301999. The next prime is 30231302041. The reversal of 30231302033 is 33020313203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30167173969 + 64128064 = 173687^2 + 8008^2 .
It is an emirp because it is prime and its reverse (33020313203) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30231302033 is a prime.
It is a super-2 number, since 2×302313020332 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30231301996 and 30231302014.
It is not a weakly prime, because it can be changed into another prime (30231302533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15115651016 + 15115651017.
It is an arithmetic number, because the mean of its divisors is an integer number (15115651017).
Almost surely, 230231302033 is an apocalyptic number.
It is an amenable number.
30231302033 is a deficient number, since it is larger than the sum of its proper divisors (1).
30231302033 is an equidigital number, since it uses as much as digits as its factorization.
30231302033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 30231302033 its reverse (33020313203), we get a palindrome (63251615236).
The spelling of 30231302033 in words is "thirty billion, two hundred thirty-one million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •