Base | Representation |
---|---|
bin | 10100111010101111… |
… | …10111010010001101 |
3 | 1001222122121221110111 |
4 | 22131113313102031 |
5 | 140444413311021 |
6 | 5054210240021 |
7 | 545203144351 |
oct | 123527672215 |
9 | 31878557414 |
10 | 11230213261 |
11 | 4843187493 |
12 | 2214b86011 |
13 | 109c82ca07 |
14 | 7876b9461 |
15 | 45adb58e1 |
hex | 29d5f748d |
11230213261 has 2 divisors, whose sum is σ = 11230213262. Its totient is φ = 11230213260.
The previous prime is 11230213259. The next prime is 11230213307. The reversal of 11230213261 is 16231203211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8325650025 + 2904563236 = 91245^2 + 53894^2 .
It is an emirp because it is prime and its reverse (16231203211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11230213261 - 21 = 11230213259 is a prime.
It is a super-2 number, since 2×112302132612 (a number of 21 digits) contains 22 as substring.
Together with 11230213259, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11230213231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615106630 + 5615106631.
It is an arithmetic number, because the mean of its divisors is an integer number (5615106631).
Almost surely, 211230213261 is an apocalyptic number.
It is an amenable number.
11230213261 is a deficient number, since it is larger than the sum of its proper divisors (1).
11230213261 is an equidigital number, since it uses as much as digits as its factorization.
11230213261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11230213261 its reverse (16231203211), we get a palindrome (27461416472).
The spelling of 11230213261 in words is "eleven billion, two hundred thirty million, two hundred thirteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •