Base | Representation |
---|---|
bin | 1010001000100111000011… |
… | …1100000111010100111011 |
3 | 1110110021010121121011120212 |
4 | 2202021300330013110323 |
5 | 2430031421213111132 |
6 | 35411013014341335 |
7 | 2230025626660601 |
oct | 242116074072473 |
9 | 43407117534525 |
10 | 11143039972667 |
11 | 3606811625559 |
12 | 12bb71965a84b |
13 | 62aa26a54835 |
14 | 2a747c813871 |
15 | 144cc92185b2 |
hex | a2270f0753b |
11143039972667 has 2 divisors, whose sum is σ = 11143039972668. Its totient is φ = 11143039972666.
The previous prime is 11143039972613. The next prime is 11143039972679. The reversal of 11143039972667 is 76627993034111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11143039972667 - 28 = 11143039972411 is a prime.
It is a super-2 number, since 2×111430399726672 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11143039572667) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5571519986333 + 5571519986334.
It is an arithmetic number, because the mean of its divisors is an integer number (5571519986334).
Almost surely, 211143039972667 is an apocalyptic number.
11143039972667 is a deficient number, since it is larger than the sum of its proper divisors (1).
11143039972667 is an equidigital number, since it uses as much as digits as its factorization.
11143039972667 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10287648, while the sum is 59.
The spelling of 11143039972667 in words is "eleven trillion, one hundred forty-three billion, thirty-nine million, nine hundred seventy-two thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •