Base | Representation |
---|---|
bin | 11100001001111010… |
… | …111000110100001001 |
3 | 2220000212100020101012 |
4 | 130021322320310021 |
5 | 443403141444311 |
6 | 21515451333305 |
7 | 2120104662212 |
oct | 341172706411 |
9 | 86025306335 |
10 | 30231203081 |
11 | 119037a9362 |
12 | 5a38451235 |
13 | 2b0a255b61 |
14 | 166b030409 |
15 | bbe09878b |
hex | 709eb8d09 |
30231203081 has 2 divisors, whose sum is σ = 30231203082. Its totient is φ = 30231203080.
The previous prime is 30231203077. The next prime is 30231203141. The reversal of 30231203081 is 18030213203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19803525625 + 10427677456 = 140725^2 + 102116^2 .
It is an emirp because it is prime and its reverse (18030213203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30231203081 - 22 = 30231203077 is a prime.
It is a super-2 number, since 2×302312030812 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30231203281) 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 as a sum of consecutive naturals, namely, 15115601540 + 15115601541.
It is an arithmetic number, because the mean of its divisors is an integer number (15115601541).
Almost surely, 230231203081 is an apocalyptic number.
It is an amenable number.
30231203081 is a deficient number, since it is larger than the sum of its proper divisors (1).
30231203081 is an equidigital number, since it uses as much as digits as its factorization.
30231203081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 30231203081 its reverse (18030213203), we get a palindrome (48261416284).
The spelling of 30231203081 in words is "thirty billion, two hundred thirty-one million, two hundred three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •