Base | Representation |
---|---|
bin | 1011001011111101011101… |
… | …0010000011010011100001 |
3 | 1121112212201100012100002111 |
4 | 2302333113102003103201 |
5 | 3103011102404431032 |
6 | 42054331151115321 |
7 | 2406440011104361 |
oct | 262772722032341 |
9 | 47485640170074 |
10 | 12300103202017 |
11 | 3a1249865a324 |
12 | 1467a13812b41 |
13 | 6b2b82a13577 |
14 | 3074847069a1 |
15 | 164e496b7c47 |
hex | b2fd74834e1 |
12300103202017 has 2 divisors, whose sum is σ = 12300103202018. Its totient is φ = 12300103202016.
The previous prime is 12300103201979. The next prime is 12300103202021. The reversal of 12300103202017 is 71020230100321.
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., 11114495813281 + 1185607388736 = 3333841^2 + 1088856^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12300103202017 is a prime.
It is not a weakly prime, because it can be changed into another prime (12300103202077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6150051601008 + 6150051601009.
It is an arithmetic number, because the mean of its divisors is an integer number (6150051601009).
Almost surely, 212300103202017 is an apocalyptic number.
It is an amenable number.
12300103202017 is a deficient number, since it is larger than the sum of its proper divisors (1).
12300103202017 is an equidigital number, since it uses as much as digits as its factorization.
12300103202017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 12300103202017 its reverse (71020230100321), we get a palindrome (83320333302338).
The spelling of 12300103202017 in words is "twelve trillion, three hundred billion, one hundred three million, two hundred two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •