Base | Representation |
---|---|
bin | 1001101011101001010100… |
… | …0101110111011101001101 |
3 | 1101200200201100012210111102 |
4 | 2122322111011313131031 |
5 | 2343403320124140131 |
6 | 34350235420232445 |
7 | 2146051454401046 |
oct | 232722505673515 |
9 | 41620640183442 |
10 | 10645430302541 |
11 | 34347799752a1 |
12 | 123b1a509b725 |
13 | 5c2b23bb8048 |
14 | 28b354c538cd |
15 | 136da339b1cb |
hex | 9ae9517774d |
10645430302541 has 2 divisors, whose sum is σ = 10645430302542. Its totient is φ = 10645430302540.
The previous prime is 10645430302459. The next prime is 10645430302583. The reversal of 10645430302541 is 14520303454601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6589596814441 + 4055833488100 = 2567021^2 + 2013910^2 .
It is a cyclic number.
It is not a de Polignac number, because 10645430302541 - 242 = 6247383791437 is a prime.
It is a super-2 number, since 2×106454303025412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10645430302495 and 10645430302504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10645430202541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322715151270 + 5322715151271.
It is an arithmetic number, because the mean of its divisors is an integer number (5322715151271).
Almost surely, 210645430302541 is an apocalyptic number.
It is an amenable number.
10645430302541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645430302541 is an equidigital number, since it uses as much as digits as its factorization.
10645430302541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 38.
The spelling of 10645430302541 in words is "ten trillion, six hundred forty-five billion, four hundred thirty million, three hundred two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •