Base | Representation |
---|---|
bin | 1001010100000101010101… |
… | …1001000011100111100001 |
3 | 1100020222212102210211010201 |
4 | 2111001111121003213201 |
5 | 2320240304433243231 |
6 | 33440252125025201 |
7 | 2104601321300545 |
oct | 225012531034741 |
9 | 40228772724121 |
10 | 10240634665441 |
11 | 3299035328854 |
12 | 11948539b5201 |
13 | 5938c2b7221b |
14 | 275913bc9a25 |
15 | 12b5b0968161 |
hex | 950556439e1 |
10240634665441 has 2 divisors, whose sum is σ = 10240634665442. Its totient is φ = 10240634665440.
The previous prime is 10240634665433. The next prime is 10240634665477. The reversal of 10240634665441 is 14456643604201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8943712284816 + 1296922380625 = 2990604^2 + 1138825^2 .
It is a cyclic number.
It is not a de Polignac number, because 10240634665441 - 23 = 10240634665433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10240634665391 and 10240634665400.
It is not a weakly prime, because it can be changed into another prime (10240634665421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5120317332720 + 5120317332721.
It is an arithmetic number, because the mean of its divisors is an integer number (5120317332721).
Almost surely, 210240634665441 is an apocalyptic number.
It is an amenable number.
10240634665441 is a deficient number, since it is larger than the sum of its proper divisors (1).
10240634665441 is an equidigital number, since it uses as much as digits as its factorization.
10240634665441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1658880, while the sum is 46.
The spelling of 10240634665441 in words is "ten trillion, two hundred forty billion, six hundred thirty-four million, six hundred sixty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •