Base | Representation |
---|---|
bin | 11011111101111111… |
… | …101000111101101001 |
3 | 2212111220212002010012 |
4 | 123331333220331221 |
5 | 443000431403111 |
6 | 21443543101305 |
7 | 2112125220236 |
oct | 337577507551 |
9 | 85456762105 |
10 | 30031122281 |
11 | 11810870726 |
12 | 59a1441835 |
13 | 2aa7970b54 |
14 | 164c62a78d |
15 | bab72548b |
hex | 6fdfe8f69 |
30031122281 has 2 divisors, whose sum is σ = 30031122282. Its totient is φ = 30031122280.
The previous prime is 30031122271. The next prime is 30031122283. The reversal of 30031122281 is 18222113003.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29037864025 + 993258256 = 170405^2 + 31516^2 .
It is a cyclic number.
It is not a de Polignac number, because 30031122281 - 234 = 12851253097 is a prime.
It is a super-2 number, since 2×300311222812 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 30031122283, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (30031122283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15015561140 + 15015561141.
It is an arithmetic number, because the mean of its divisors is an integer number (15015561141).
Almost surely, 230031122281 is an apocalyptic number.
It is an amenable number.
30031122281 is a deficient number, since it is larger than the sum of its proper divisors (1).
30031122281 is an equidigital number, since it uses as much as digits as its factorization.
30031122281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 30031122281 its reverse (18222113003), we get a palindrome (48253235284).
The spelling of 30031122281 in words is "thirty billion, thirty-one million, one hundred twenty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •