Base | Representation |
---|---|
bin | 1001001100000010110010… |
… | …1110011011110100111001 |
3 | 1022202210100112101002200211 |
4 | 2103000230232123310321 |
5 | 2311004421420402142 |
6 | 33253010340031121 |
7 | 2061611462321242 |
oct | 223005456336471 |
9 | 38683315332624 |
10 | 10102513450297 |
11 | 32454a751a574 |
12 | 1171b273924a1 |
13 | 5838805c6558 |
14 | 26cd6dd01cc9 |
15 | 127bc9b63917 |
hex | 9302cb9bd39 |
10102513450297 has 2 divisors, whose sum is σ = 10102513450298. Its totient is φ = 10102513450296.
The previous prime is 10102513450283. The next prime is 10102513450307. The reversal of 10102513450297 is 79205431520101.
10102513450297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9656748915961 + 445764534336 = 3107531^2 + 667656^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102513450297 - 235 = 10068153711929 is a prime.
It is not a weakly prime, because it can be changed into another prime (10102513450247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051256725148 + 5051256725149.
It is an arithmetic number, because the mean of its divisors is an integer number (5051256725149).
Almost surely, 210102513450297 is an apocalyptic number.
It is an amenable number.
10102513450297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102513450297 is an equidigital number, since it uses as much as digits as its factorization.
10102513450297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 75600, while the sum is 40.
Adding to 10102513450297 its reverse (79205431520101), we get a palindrome (89307944970398).
The spelling of 10102513450297 in words is "ten trillion, one hundred two billion, five hundred thirteen million, four hundred fifty thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •