Base | Representation |
---|---|
bin | 10100100000101111… |
… | …11111100001101101 |
3 | 1001102110021211121001 |
4 | 22100113333201231 |
5 | 140023102040323 |
6 | 5020420240301 |
7 | 536614446541 |
oct | 122027774155 |
9 | 31373254531 |
10 | 11012143213 |
11 | 4741082205 |
12 | 2173b40091 |
13 | 10665b9896 |
14 | 766751a21 |
15 | 446b8c3ad |
hex | 2905ff86d |
11012143213 has 2 divisors, whose sum is σ = 11012143214. Its totient is φ = 11012143212.
The previous prime is 11012143151. The next prime is 11012143217. The reversal of 11012143213 is 31234121011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10996039044 + 16104169 = 104862^2 + 4013^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11012143213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012143217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506071606 + 5506071607.
It is an arithmetic number, because the mean of its divisors is an integer number (5506071607).
Almost surely, 211012143213 is an apocalyptic number.
It is an amenable number.
11012143213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012143213 is an equidigital number, since it uses as much as digits as its factorization.
11012143213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11012143213 its reverse (31234121011), we get a palindrome (42246264224).
The spelling of 11012143213 in words is "eleven billion, twelve million, one hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •