Base | Representation |
---|---|
bin | 1010000110110101011010… |
… | …0001101011110101011101 |
3 | 1110100100101110120220201222 |
4 | 2201231112201223311131 |
5 | 2424031431202100004 |
6 | 35345005440143125 |
7 | 2224565622023321 |
oct | 241552641536535 |
9 | 43310343526658 |
10 | 11112532065629 |
11 | 35a4886714445 |
12 | 12b5824607aa5 |
13 | 627ba4399637 |
14 | 2a5bc6b55981 |
15 | 1440e0c137be |
hex | a1b5686bd5d |
11112532065629 has 2 divisors, whose sum is σ = 11112532065630. Its totient is φ = 11112532065628.
The previous prime is 11112532065581. The next prime is 11112532065631. The reversal of 11112532065629 is 92656023521111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7331070684025 + 3781461381604 = 2707595^2 + 1944598^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112532065629 - 28 = 11112532065373 is a prime.
Together with 11112532065631, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11112532065629.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112532065659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556266032814 + 5556266032815.
It is an arithmetic number, because the mean of its divisors is an integer number (5556266032815).
Almost surely, 211112532065629 is an apocalyptic number.
It is an amenable number.
11112532065629 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112532065629 is an equidigital number, since it uses as much as digits as its factorization.
11112532065629 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 44.
The spelling of 11112532065629 in words is "eleven trillion, one hundred twelve billion, five hundred thirty-two million, sixty-five thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •