Base | Representation |
---|---|
bin | 110101110001111100… |
… | …1101001111100010001 |
3 | 102001002212212121221002 |
4 | 1223203321221330101 |
5 | 3343012112113404 |
6 | 125020121111345 |
7 | 11226005452652 |
oct | 1534371517421 |
9 | 361085777832 |
10 | 115492691729 |
11 | 44a86682768 |
12 | 1a472328555 |
13 | ab7745225c |
14 | 5838897529 |
15 | 300e421c1e |
hex | 1ae3e69f11 |
115492691729 has 2 divisors, whose sum is σ = 115492691730. Its totient is φ = 115492691728.
The previous prime is 115492691689. The next prime is 115492691749. The reversal of 115492691729 is 927196294511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105023309329 + 10469382400 = 324073^2 + 102320^2 .
It is an emirp because it is prime and its reverse (927196294511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115492691729 - 224 = 115475914513 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (115492691749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57746345864 + 57746345865.
It is an arithmetic number, because the mean of its divisors is an integer number (57746345865).
Almost surely, 2115492691729 is an apocalyptic number.
It is an amenable number.
115492691729 is a deficient number, since it is larger than the sum of its proper divisors (1).
115492691729 is an equidigital number, since it uses as much as digits as its factorization.
115492691729 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2449440, while the sum is 56.
The spelling of 115492691729 in words is "one hundred fifteen billion, four hundred ninety-two million, six hundred ninety-one thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •