Base | Representation |
---|---|
bin | 1011001011111101011111… |
… | …1000010001010110100111 |
3 | 1121112212202001001100121002 |
4 | 2302333113320101112213 |
5 | 3103011112441033111 |
6 | 42054332145543515 |
7 | 2406440162213336 |
oct | 262772770212647 |
9 | 47485661040532 |
10 | 12300113221031 |
11 | 3a124a32827a9 |
12 | 1467a17044b9b |
13 | 6b2b84b1098c |
14 | 307485b93d1d |
15 | 164e4a4e663b |
hex | b2fd7e115a7 |
12300113221031 has 2 divisors, whose sum is σ = 12300113221032. Its totient is φ = 12300113221030.
The previous prime is 12300113221001. The next prime is 12300113221037. The reversal of 12300113221031 is 13012231100321.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12300113221031 - 210 = 12300113220007 is a prime.
It is a super-2 number, since 2×123001132210312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 12300113220994 and 12300113221012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12300113221037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6150056610515 + 6150056610516.
It is an arithmetic number, because the mean of its divisors is an integer number (6150056610516).
Almost surely, 212300113221031 is an apocalyptic number.
12300113221031 is a deficient number, since it is larger than the sum of its proper divisors (1).
12300113221031 is an equidigital number, since it uses as much as digits as its factorization.
12300113221031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12300113221031 its reverse (13012231100321), we get a palindrome (25312344321352).
The spelling of 12300113221031 in words is "twelve trillion, three hundred billion, one hundred thirteen million, two hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •