Base | Representation |
---|---|
bin | 10010110111110110… |
… | …10001101001001011 |
3 | 222011010112002110002 |
4 | 21123323101221023 |
5 | 131222320400021 |
6 | 4353224113215 |
7 | 506041164503 |
oct | 113373215113 |
9 | 28133462402 |
10 | 10132200011 |
11 | 432a3a991a |
12 | 1b6930580b |
13 | c561c642b |
14 | 6c1936a03 |
15 | 3e47c350b |
hex | 25bed1a4b |
10132200011 has 2 divisors, whose sum is σ = 10132200012. Its totient is φ = 10132200010.
The previous prime is 10132200007. The next prime is 10132200019. The reversal of 10132200011 is 11000223101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10132200011 - 22 = 10132200007 is a prime.
It is a super-2 number, since 2×101322000112 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10132199965 and 10132200001.
It is not a weakly prime, because it can be changed into another prime (10132200019) 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, 5066100005 + 5066100006.
It is an arithmetic number, because the mean of its divisors is an integer number (5066100006).
Almost surely, 210132200011 is an apocalyptic number.
10132200011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132200011 is an equidigital number, since it uses as much as digits as its factorization.
10132200011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 10132200011 its reverse (11000223101), we get a palindrome (21132423112).
The spelling of 10132200011 in words is "ten billion, one hundred thirty-two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •