Base | Representation |
---|---|
bin | 110101111000100010… |
… | …1101001110010111101 |
3 | 102001200022012020102021 |
4 | 1223301011221302331 |
5 | 3343440232100134 |
6 | 125054103200141 |
7 | 11234333160415 |
oct | 1536105516275 |
9 | 361608166367 |
10 | 115713940669 |
11 | 4508a559328 |
12 | 1a514446051 |
13 | abb12392a2 |
14 | 585a00b645 |
15 | 3023a770b4 |
hex | 1af1169cbd |
115713940669 has 2 divisors, whose sum is σ = 115713940670. Its totient is φ = 115713940668.
The previous prime is 115713940597. The next prime is 115713940673. The reversal of 115713940669 is 966049317511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103484456100 + 12229484569 = 321690^2 + 110587^2 .
It is a cyclic number.
It is not a de Polignac number, because 115713940669 - 235 = 81354202301 is a prime.
It is a super-2 number, since 2×1157139406692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115713940469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57856970334 + 57856970335.
It is an arithmetic number, because the mean of its divisors is an integer number (57856970335).
Almost surely, 2115713940669 is an apocalyptic number.
It is an amenable number.
115713940669 is a deficient number, since it is larger than the sum of its proper divisors (1).
115713940669 is an equidigital number, since it uses as much as digits as its factorization.
115713940669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1224720, while the sum is 52.
The spelling of 115713940669 in words is "one hundred fifteen billion, seven hundred thirteen million, nine hundred forty thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •