Base | Representation |
---|---|
bin | 10101010000101111… |
… | …01010000101110101 |
3 | 1002110111210021111002 |
4 | 22220113222011311 |
5 | 141334131133342 |
6 | 5124400453045 |
7 | 552603264545 |
oct | 125027520565 |
9 | 32414707432 |
10 | 11414708597 |
11 | 492833a576 |
12 | 226691a185 |
13 | 10cbb18a56 |
14 | 7a3dc3325 |
15 | 46c1aad32 |
hex | 2a85ea175 |
11414708597 has 2 divisors, whose sum is σ = 11414708598. Its totient is φ = 11414708596.
The previous prime is 11414708579. The next prime is 11414708611. The reversal of 11414708597 is 79580741411.
11414708597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (11414708579) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10731095281 + 683613316 = 103591^2 + 26146^2 .
It is a cyclic number.
It is not a de Polignac number, because 11414708597 - 214 = 11414692213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11414708297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5707354298 + 5707354299.
It is an arithmetic number, because the mean of its divisors is an integer number (5707354299).
Almost surely, 211414708597 is an apocalyptic number.
It is an amenable number.
11414708597 is a deficient number, since it is larger than the sum of its proper divisors (1).
11414708597 is an equidigital number, since it uses as much as digits as its factorization.
11414708597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 282240, while the sum is 47.
The spelling of 11414708597 in words is "eleven billion, four hundred fourteen million, seven hundred eight thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •