Base | Representation |
---|---|
bin | 10100111000100101… |
… | …10001000110110111 |
3 | 1001221101112200202211 |
4 | 22130102301012313 |
5 | 140430244200043 |
6 | 5052322114251 |
7 | 544563164155 |
oct | 123422610667 |
9 | 31841480684 |
10 | 11212100023 |
11 | 4833a35773 |
12 | 220aaab987 |
13 | 1098b5a317 |
14 | 7851223d5 |
15 | 4594d8a9d |
hex | 29c4b11b7 |
11212100023 has 2 divisors, whose sum is σ = 11212100024. Its totient is φ = 11212100022.
The previous prime is 11212099979. The next prime is 11212100063. The reversal of 11212100023 is 32000121211.
11212100023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11212100023 - 29 = 11212099511 is a prime.
It is a super-2 number, since 2×112121000232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11212099976 and 11212100012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11212100063) 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, 5606050011 + 5606050012.
It is an arithmetic number, because the mean of its divisors is an integer number (5606050012).
Almost surely, 211212100023 is an apocalyptic number.
11212100023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212100023 is an equidigital number, since it uses as much as digits as its factorization.
11212100023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11212100023 its reverse (32000121211), we get a palindrome (43212221234).
The spelling of 11212100023 in words is "eleven billion, two hundred twelve million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •