Base | Representation |
---|---|
bin | 1001011011100011011000… |
… | …0010010110111001100001 |
3 | 1100201021002111010100201212 |
4 | 2112320312002112321201 |
5 | 2324341111123442124 |
6 | 34015233335435505 |
7 | 2120063302502003 |
oct | 226706602267141 |
9 | 40637074110655 |
10 | 10368957640289 |
11 | 33384a52a7086 |
12 | 11b56a6b25b95 |
13 | 5a2a33482981 |
14 | 27bc08670373 |
15 | 12eac146540e |
hex | 96e36096e61 |
10368957640289 has 2 divisors, whose sum is σ = 10368957640290. Its totient is φ = 10368957640288.
The previous prime is 10368957640273. The next prime is 10368957640339. The reversal of 10368957640289 is 98204675986301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7617555840064 + 2751401800225 = 2759992^2 + 1658735^2 .
It is a cyclic number.
It is not a de Polignac number, because 10368957640289 - 24 = 10368957640273 is a prime.
It is a super-2 number, since 2×103689576402892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10368957649289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5184478820144 + 5184478820145.
It is an arithmetic number, because the mean of its divisors is an integer number (5184478820145).
It is a 1-persistent number, because it is pandigital, but 2⋅10368957640289 = 20737915280578 is not.
Almost surely, 210368957640289 is an apocalyptic number.
It is an amenable number.
10368957640289 is a deficient number, since it is larger than the sum of its proper divisors (1).
10368957640289 is an equidigital number, since it uses as much as digits as its factorization.
10368957640289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 156764160, while the sum is 68.
The spelling of 10368957640289 in words is "ten trillion, three hundred sixty-eight billion, nine hundred fifty-seven million, six hundred forty thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.853 sec. • engine limits •