Base | Representation |
---|---|
bin | 1001011011100000110010… |
… | …1111001110110001001101 |
3 | 1100201012022012100102012122 |
4 | 2112320030233032301031 |
5 | 2324333201234313042 |
6 | 34015040504542325 |
7 | 2120040160224005 |
oct | 226701457166115 |
9 | 40635265312178 |
10 | 10368264760397 |
11 | 333817a180175 |
12 | 11b5532a819a5 |
13 | 5a2952a6737b |
14 | 27bb8062b005 |
15 | 12ea806ec7d2 |
hex | 96e0cbcec4d |
10368264760397 has 2 divisors, whose sum is σ = 10368264760398. Its totient is φ = 10368264760396.
The previous prime is 10368264760361. The next prime is 10368264760423. The reversal of 10368264760397 is 79306746286301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10059718950436 + 308545809961 = 3171706^2 + 555469^2 .
It is a cyclic number.
It is not a de Polignac number, because 10368264760397 - 212 = 10368264756301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10368264760307) 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, 5184132380198 + 5184132380199.
It is an arithmetic number, because the mean of its divisors is an integer number (5184132380199).
Almost surely, 210368264760397 is an apocalyptic number.
It is an amenable number.
10368264760397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10368264760397 is an equidigital number, since it uses as much as digits as its factorization.
10368264760397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54867456, while the sum is 62.
The spelling of 10368264760397 in words is "ten trillion, three hundred sixty-eight billion, two hundred sixty-four million, seven hundred sixty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •