Base | Representation |
---|---|
bin | 1010000010101000011110… |
… | …1111001110111000111111 |
3 | 1110002110001111121110101202 |
4 | 2200222013233032320333 |
5 | 2421341110333203024 |
6 | 35251510315330115 |
7 | 2216431666204334 |
oct | 240520757167077 |
9 | 43073044543352 |
10 | 11040343256639 |
11 | 3577201a46824 |
12 | 12a383875093b |
13 | 62113b63b348 |
14 | 2a24d957698b |
15 | 1422b8396bae |
hex | a0a87bcee3f |
11040343256639 has 2 divisors, whose sum is σ = 11040343256640. Its totient is φ = 11040343256638.
The previous prime is 11040343256609. The next prime is 11040343256647. The reversal of 11040343256639 is 93665234304011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11040343256639 - 224 = 11040326479423 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 11040343256593 and 11040343256602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11040343256609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5520171628319 + 5520171628320.
It is an arithmetic number, because the mean of its divisors is an integer number (5520171628320).
Almost surely, 211040343256639 is an apocalyptic number.
11040343256639 is a deficient number, since it is larger than the sum of its proper divisors (1).
11040343256639 is an equidigital number, since it uses as much as digits as its factorization.
11040343256639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 47.
The spelling of 11040343256639 in words is "eleven trillion, forty billion, three hundred forty-three million, two hundred fifty-six thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •