Base | Representation |
---|---|
bin | 10011000011110001… |
… | …10010101010001111 |
3 | 222102002201020020221 |
4 | 21201320302222033 |
5 | 131423421241421 |
6 | 4411155452211 |
7 | 511364240122 |
oct | 114170625217 |
9 | 28362636227 |
10 | 10232212111 |
11 | 43808a9450 |
12 | 1b968b7067 |
13 | c70b425a4 |
14 | 6d0d2c3b9 |
15 | 3ed47b841 |
hex | 261e32a8f |
10232212111 has 16 divisors (see below), whose sum is σ = 11229517728. Its totient is φ = 9246182400.
The previous prime is 10232212091. The next prime is 10232212141. The reversal of 10232212111 is 11121223201.
10232212111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10232212111 - 25 = 10232212079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232212141) 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 in 15 ways as a sum of consecutive naturals, for example, 4057531 + ... + 4060051.
It is an arithmetic number, because the mean of its divisors is an integer number (701844858).
Almost surely, 210232212111 is an apocalyptic number.
10232212111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10232212111 is a deficient number, since it is larger than the sum of its proper divisors (997305617).
10232212111 is a wasteful number, since it uses less digits than its factorization.
10232212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4602.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10232212111 its reverse (11121223201), we get a palindrome (21353435312).
The spelling of 10232212111 in words is "ten billion, two hundred thirty-two million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •