Base | Representation |
---|---|
bin | 10100111010110000… |
… | …11100001111110001 |
3 | 1001222122220122010202 |
4 | 22131120130033301 |
5 | 140444433132112 |
6 | 5054213404545 |
7 | 545204344631 |
oct | 123530341761 |
9 | 31878818122 |
10 | 11230364657 |
11 | 4843280206 |
12 | 2215039755 |
13 | 109c8838b5 |
14 | 7877186c1 |
15 | 45ade56c2 |
hex | 29d61c3f1 |
11230364657 has 2 divisors, whose sum is σ = 11230364658. Its totient is φ = 11230364656.
The previous prime is 11230364633. The next prime is 11230364659. The reversal of 11230364657 is 75646303211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5887339441 + 5343025216 = 76729^2 + 73096^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11230364657 is a prime.
It is a super-2 number, since 2×112303646572 (a number of 21 digits) contains 22 as substring.
Together with 11230364659, 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 11230364657.
It is not a weakly prime, because it can be changed into another prime (11230364659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615182328 + 5615182329.
It is an arithmetic number, because the mean of its divisors is an integer number (5615182329).
Almost surely, 211230364657 is an apocalyptic number.
It is an amenable number.
11230364657 is a deficient number, since it is larger than the sum of its proper divisors (1).
11230364657 is an equidigital number, since it uses as much as digits as its factorization.
11230364657 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 11230364657 its reverse (75646303211), we get a palindrome (86876667868).
The spelling of 11230364657 in words is "eleven billion, two hundred thirty million, three hundred sixty-four thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •