Base | Representation |
---|---|
bin | 10010111111111101… |
… | …01101111010100110 |
3 | 222022212111102010200 |
4 | 21133332231322212 |
5 | 131342223223420 |
6 | 4404053531330 |
7 | 510525235545 |
oct | 113776557246 |
9 | 28285442120 |
10 | 10200211110 |
11 | 4364831641 |
12 | 1b88043b46 |
13 | c6731989b |
14 | 6ca99c15c |
15 | 3ea759b90 |
hex | 25ffadea6 |
10200211110 has 48 divisors (see below), whose sum is σ = 26551695456. Its totient is φ = 2716861824.
The previous prime is 10200211079. The next prime is 10200211129. The reversal of 10200211110 is 1111200201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10200211092 and 10200211101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11007 + ... + 143253.
It is an arithmetic number, because the mean of its divisors is an integer number (553160322).
Almost surely, 210200211110 is an apocalyptic number.
10200211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10200211110 is an abundant number, since it is smaller than the sum of its proper divisors (16351484346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200211110 is a wasteful number, since it uses less digits than its factorization.
10200211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133117 (or 133114 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10200211110 its reverse (1111200201), we get a palindrome (11311411311).
The spelling of 10200211110 in words is "ten billion, two hundred million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •