Base | Representation |
---|---|
bin | 1001001011110001111000… |
… | …0110011111010010101001 |
3 | 1022202100122002221221200222 |
4 | 2102330132012133102221 |
5 | 2310421122110133114 |
6 | 33250540025135425 |
7 | 2061361121251103 |
oct | 222743606372251 |
9 | 38670562857628 |
10 | 10097973130409 |
11 | 324358763aa8a |
12 | 117107a92a575 |
13 | 583308a73738 |
14 | 26ca5ccdc573 |
15 | 127a1125d98e |
hex | 92f1e19f4a9 |
10097973130409 has 2 divisors, whose sum is σ = 10097973130410. Its totient is φ = 10097973130408.
The previous prime is 10097973130331. The next prime is 10097973130417. The reversal of 10097973130409 is 90403137979001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6010479850384 + 4087493280025 = 2451628^2 + 2021755^2 .
It is a cyclic number.
It is not a de Polignac number, because 10097973130409 - 220 = 10097972081833 is a prime.
It is a super-2 number, since 2×100979731304092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10097973130309) 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, 5048986565204 + 5048986565205.
It is an arithmetic number, because the mean of its divisors is an integer number (5048986565205).
Almost surely, 210097973130409 is an apocalyptic number.
It is an amenable number.
10097973130409 is a deficient number, since it is larger than the sum of its proper divisors (1).
10097973130409 is an equidigital number, since it uses as much as digits as its factorization.
10097973130409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1285956, while the sum is 53.
The spelling of 10097973130409 in words is "ten trillion, ninety-seven billion, nine hundred seventy-three million, one hundred thirty thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •