Base | Representation |
---|---|
bin | 1101101100011010011001… |
… | …00111110101011110100011 |
3 | 10221121210200201221020220222 |
4 | 12312031030213311132203 |
5 | 12421334020103121311 |
6 | 144013505401353255 |
7 | 6225420451035404 |
oct | 666151447653643 |
9 | 127553621836828 |
10 | 30113301223331 |
11 | 965aa85541107 |
12 | 34641ab79882b |
13 | 13a5897859231 |
14 | 7616c4b879ab |
15 | 3734b1b16adb |
hex | 1b634c9f57a3 |
30113301223331 has 2 divisors, whose sum is σ = 30113301223332. Its totient is φ = 30113301223330.
The previous prime is 30113301223309. The next prime is 30113301223409. The reversal of 30113301223331 is 13332210331103.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 30113301223331 - 230 = 30112227481507 is a prime.
It is a super-2 number, since 2×301133012233312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30113301223331.
It is not a weakly prime, because it can be changed into another prime (30113301223231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15056650611665 + 15056650611666.
It is an arithmetic number, because the mean of its divisors is an integer number (15056650611666).
Almost surely, 230113301223331 is an apocalyptic number.
30113301223331 is a deficient number, since it is larger than the sum of its proper divisors (1).
30113301223331 is an equidigital number, since it uses as much as digits as its factorization.
30113301223331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 30113301223331 its reverse (13332210331103), we get a palindrome (43445511554434).
The spelling of 30113301223331 in words is "thirty trillion, one hundred thirteen billion, three hundred one million, two hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •