Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10010110100010110 |
3 | 222002122211012201210 |
4 | 21122222302310112 |
5 | 131201420232410 |
6 | 4351152002250 |
7 | 505363644105 |
oct | 113252626426 |
9 | 28078735653 |
10 | 10111102230 |
11 | 43194a9839 |
12 | 1b62230386 |
13 | c51a1a438 |
14 | 6bcc0403c |
15 | 3e2a07220 |
hex | 25aab2d16 |
10111102230 has 32 divisors (see below), whose sum is σ = 24330700800. Its totient is φ = 2689176672.
The previous prime is 10111102193. The next prime is 10111102231. The reversal of 10111102230 is 3220111101.
10111102230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111102231) 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, 433270 + ... + 456009.
It is an arithmetic number, because the mean of its divisors is an integer number (760334400).
Almost surely, 210111102230 is an apocalyptic number.
10111102230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10111102230 is an abundant number, since it is smaller than the sum of its proper divisors (14219598570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111102230 is a wasteful number, since it uses less digits than its factorization.
10111102230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889668.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10111102230 its reverse (3220111101), we get a palindrome (13331213331).
The spelling of 10111102230 in words is "ten billion, one hundred eleven million, one hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •