Base | Representation |
---|---|
bin | 1001001110000000110011… |
… | …1110010010001101111001 |
3 | 1022220000122222212212212022 |
4 | 2103200030332102031321 |
5 | 2312033211130111242 |
6 | 33320323122324225 |
7 | 2064216652263635 |
oct | 223401476221571 |
9 | 38800588785768 |
10 | 10136340472697 |
11 | 3258885a4112a |
12 | 11785a7ab9675 |
13 | 586b117c763a |
14 | 27085c713dc5 |
15 | 128a097450d2 |
hex | 9380cf92379 |
10136340472697 has 2 divisors, whose sum is σ = 10136340472698. Its totient is φ = 10136340472696.
The previous prime is 10136340472681. The next prime is 10136340472703. The reversal of 10136340472697 is 79627404363101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9973115584576 + 163224888121 = 3158024^2 + 404011^2 .
It is a cyclic number.
It is not a de Polignac number, because 10136340472697 - 24 = 10136340472681 is a prime.
It is not a weakly prime, because it can be changed into another prime (10136340472627) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5068170236348 + 5068170236349.
It is an arithmetic number, because the mean of its divisors is an integer number (5068170236349).
Almost surely, 210136340472697 is an apocalyptic number.
It is an amenable number.
10136340472697 is a deficient number, since it is larger than the sum of its proper divisors (1).
10136340472697 is an equidigital number, since it uses as much as digits as its factorization.
10136340472697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4572288, while the sum is 53.
Subtracting from 10136340472697 its sum of digits (53), we obtain a square (10136340472644 = 31837622).
The spelling of 10136340472697 in words is "ten trillion, one hundred thirty-six billion, three hundred forty million, four hundred seventy-two thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •