Base | Representation |
---|---|
bin | 10101001101110110… |
… | …10010011101100111 |
3 | 1002101211020002002011 |
4 | 22212323102131213 |
5 | 141311431311232 |
6 | 5122133455051 |
7 | 552160414654 |
oct | 124673223547 |
9 | 32354202064 |
10 | 11390494567 |
11 | 4915701181 |
12 | 225a7a1487 |
13 | 10c6abb51a |
14 | 7a0abcc2b |
15 | 469ec6547 |
hex | 2a6ed2767 |
11390494567 has 2 divisors, whose sum is σ = 11390494568. Its totient is φ = 11390494566.
The previous prime is 11390494541. The next prime is 11390494613. The reversal of 11390494567 is 76549409311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11390494567 - 27 = 11390494439 is a prime.
It is a super-3 number, since 3×113904945673 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11390494567.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11390494667) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5695247283 + 5695247284.
It is an arithmetic number, because the mean of its divisors is an integer number (5695247284).
Almost surely, 211390494567 is an apocalyptic number.
11390494567 is a deficient number, since it is larger than the sum of its proper divisors (1).
11390494567 is an equidigital number, since it uses as much as digits as its factorization.
11390494567 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 816480, while the sum is 49.
The spelling of 11390494567 in words is "eleven billion, three hundred ninety million, four hundred ninety-four thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •