Base | Representation |
---|---|
bin | 1101101100011000011000… |
… | …10100001001101001001111 |
3 | 10221121200220112210100110221 |
4 | 12312030030110021221033 |
5 | 12421324312403234411 |
6 | 144013210341012211 |
7 | 6225351640363261 |
oct | 666141424115117 |
9 | 127550815710427 |
10 | 30112222321231 |
11 | 965a581526a86 |
12 | 3463b4a3b4067 |
13 | 13a575518461b |
14 | 76162177bb31 |
15 | 37344c04c071 |
hex | 1b630c509a4f |
30112222321231 has 2 divisors, whose sum is σ = 30112222321232. Its totient is φ = 30112222321230.
The previous prime is 30112222321193. The next prime is 30112222321297. The reversal of 30112222321231 is 13212322221103.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30112222321231 is a prime.
It is a super-2 number, since 2×301122223212312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30112222321196 and 30112222321205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30112222321631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15056111160615 + 15056111160616.
It is an arithmetic number, because the mean of its divisors is an integer number (15056111160616).
Almost surely, 230112222321231 is an apocalyptic number.
30112222321231 is a deficient number, since it is larger than the sum of its proper divisors (1).
30112222321231 is an equidigital number, since it uses as much as digits as its factorization.
30112222321231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 30112222321231 its reverse (13212322221103), we get a palindrome (43324544542334).
The spelling of 30112222321231 in words is "thirty trillion, one hundred twelve billion, two hundred twenty-two million, three hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •