Base | Representation |
---|---|
bin | 10100010001110100… |
… | …01100111010101101 |
3 | 1001002201121110220202 |
4 | 22020322030322231 |
5 | 134244021040404 |
6 | 5000143523245 |
7 | 533534031332 |
oct | 121072147255 |
9 | 31081543822 |
10 | 10886893229 |
11 | 4687405023 |
12 | 2139bb9525 |
13 | 1046675174 |
14 | 753c6a989 |
15 | 43ab9b21e |
hex | 288e8cead |
10886893229 has 2 divisors, whose sum is σ = 10886893230. Its totient is φ = 10886893228.
The previous prime is 10886893217. The next prime is 10886893243. The reversal of 10886893229 is 92239868801.
10886893229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10380553225 + 506340004 = 101885^2 + 22502^2 .
It is an emirp because it is prime and its reverse (92239868801) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10886893229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10886893249) 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, 5443446614 + 5443446615.
It is an arithmetic number, because the mean of its divisors is an integer number (5443446615).
Almost surely, 210886893229 is an apocalyptic number.
It is an amenable number.
10886893229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10886893229 is an equidigital number, since it uses as much as digits as its factorization.
10886893229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2985984, while the sum is 56.
The spelling of 10886893229 in words is "ten billion, eight hundred eighty-six million, eight hundred ninety-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •