Base | Representation |
---|---|
bin | 101111100011000111… |
… | …1100100111110111100 |
3 | 100202120020101122012011 |
4 | 1133012033210332330 |
5 | 3133110204021340 |
6 | 114524144221004 |
7 | 10243246360021 |
oct | 1370617447674 |
9 | 322506348164 |
10 | 102110220220 |
11 | 3a339614858 |
12 | 1795860a764 |
13 | 9823a68468 |
14 | 4d2940b548 |
15 | 29c96200ea |
hex | 17c63e4fbc |
102110220220 has 48 divisors (see below), whose sum is σ = 217428220800. Its totient is φ = 40273583616.
The previous prime is 102110220209. The next prime is 102110220323. The reversal of 102110220220 is 22022011201.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 102110220220.
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 15 ways as a sum of consecutive naturals, for example, 7209706 + ... + 7223854.
It is an arithmetic number, because the mean of its divisors is an integer number (4529754600).
Almost surely, 2102110220220 is an apocalyptic number.
102110220220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102110220220 is an abundant number, since it is smaller than the sum of its proper divisors (115318000580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102110220220 is a wasteful number, since it uses less digits than its factorization.
102110220220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19174 (or 19172 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102110220220 its reverse (22022011201), we get a palindrome (124132231421).
The spelling of 102110220220 in words is "one hundred two billion, one hundred ten million, two hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •