Base | Representation |
---|---|
bin | 10011010100000111… |
… | …01111101111111001 |
3 | 222202122200002112121 |
4 | 21222003233233321 |
5 | 132214020121442 |
6 | 4432534041241 |
7 | 514650415462 |
oct | 115203575771 |
9 | 28678602477 |
10 | 10369301497 |
11 | 4441222765 |
12 | 20147a9221 |
13 | c93370b79 |
14 | 705215d69 |
15 | 40a50a967 |
hex | 26a0efbf9 |
10369301497 has 2 divisors, whose sum is σ = 10369301498. Its totient is φ = 10369301496.
The previous prime is 10369301479. The next prime is 10369301573. The reversal of 10369301497 is 79410396301.
Together with previous prime (10369301479) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7933286761 + 2436014736 = 89069^2 + 49356^2 .
It is a cyclic number.
It is not a de Polignac number, because 10369301497 - 211 = 10369299449 is a prime.
It is not a weakly prime, because it can be changed into another prime (10369301417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5184650748 + 5184650749.
It is an arithmetic number, because the mean of its divisors is an integer number (5184650749).
Almost surely, 210369301497 is an apocalyptic number.
It is an amenable number.
10369301497 is a deficient number, since it is larger than the sum of its proper divisors (1).
10369301497 is an equidigital number, since it uses as much as digits as its factorization.
10369301497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 43.
Adding to 10369301497 its reverse (79410396301), we get a palindrome (89779697798).
The spelling of 10369301497 in words is "ten billion, three hundred sixty-nine million, three hundred one thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •