Base | Representation |
---|---|
bin | 10010110100010011… |
… | …01101110101100101 |
3 | 222002001111200010222 |
4 | 21122021231311211 |
5 | 131142210243302 |
6 | 4350242054125 |
7 | 505230150554 |
oct | 113211556545 |
9 | 28061450128 |
10 | 10102431077 |
11 | 4314616aa2 |
12 | 1b5b34a345 |
13 | c4cca268b |
14 | 6bb9c7d9b |
15 | 3e1d92da2 |
hex | 25a26dd65 |
10102431077 has 2 divisors, whose sum is σ = 10102431078. Its totient is φ = 10102431076.
The previous prime is 10102431023. The next prime is 10102431103. The reversal of 10102431077 is 77013420101.
It is a happy number.
It is an a-pointer prime, because the next prime (10102431103) can be obtained adding 10102431077 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7314696676 + 2787734401 = 85526^2 + 52799^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102431077 - 212 = 10102426981 is a prime.
It is a super-2 number, since 2×101024310772 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10102431377) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051215538 + 5051215539.
It is an arithmetic number, because the mean of its divisors is an integer number (5051215539).
Almost surely, 210102431077 is an apocalyptic number.
It is an amenable number.
10102431077 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102431077 is an equidigital number, since it uses as much as digits as its factorization.
10102431077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1176, while the sum is 26.
Adding to 10102431077 its reverse (77013420101), we get a palindrome (87115851178).
The spelling of 10102431077 in words is "ten billion, one hundred two million, four hundred thirty-one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •