Base | Representation |
---|---|
bin | 10011101111110111… |
… | …11100111101100001 |
3 | 1000100212210111012221 |
4 | 21313323330331201 |
5 | 133203121430424 |
6 | 4512012351041 |
7 | 523505461444 |
oct | 116773747541 |
9 | 30325714187 |
10 | 10602139489 |
11 | 45506a4357 |
12 | 207a775481 |
13 | ccc684b26 |
14 | 72810565b |
15 | 420b9e9e4 |
hex | 277efcf61 |
10602139489 has 2 divisors, whose sum is σ = 10602139490. Its totient is φ = 10602139488.
The previous prime is 10602139487. The next prime is 10602139589. The reversal of 10602139489 is 98493120601.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5949808225 + 4652331264 = 77135^2 + 68208^2 .
It is an emirp because it is prime and its reverse (98493120601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10602139489 - 21 = 10602139487 is a prime.
It is a super-2 number, since 2×106021394892 (a number of 21 digits) contains 22 as substring.
Together with 10602139487, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10602139487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5301069744 + 5301069745.
It is an arithmetic number, because the mean of its divisors is an integer number (5301069745).
Almost surely, 210602139489 is an apocalyptic number.
It is an amenable number.
10602139489 is a deficient number, since it is larger than the sum of its proper divisors (1).
10602139489 is an equidigital number, since it uses as much as digits as its factorization.
10602139489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 43.
The spelling of 10602139489 in words is "ten billion, six hundred two million, one hundred thirty-nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •