Base | Representation |
---|---|
bin | 101111100011001011… |
… | …0110100110110011100 |
3 | 100202120100222011111112 |
4 | 1133012112310312130 |
5 | 3133111200321340 |
6 | 114524253041152 |
7 | 10243301462255 |
oct | 1370626646634 |
9 | 322510864445 |
10 | 102112120220 |
11 | 3a33a6a2300 |
12 | 179591861b8 |
13 | 9824282216 |
14 | 4d29783b2c |
15 | 29c9898065 |
hex | 17c65b4d9c |
102112120220 has 72 divisors (see below), whose sum is σ = 236346073152. Its totient is φ = 37030181760.
The previous prime is 102112120217. The next prime is 102112120259. The reversal of 102112120220 is 22021211201.
It is a junction number, because it is equal to n+sod(n) for n = 102112120195 and 102112120204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 830654 + ... + 945626.
Almost surely, 2102112120220 is an apocalyptic number.
102112120220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102112120220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118173036576).
102112120220 is an abundant number, since it is smaller than the sum of its proper divisors (134233952932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102112120220 is a wasteful number, since it uses less digits than its factorization.
102112120220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115371 (or 115358 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102112120220 its reverse (22021211201), we get a palindrome (124133331421).
The spelling of 102112120220 in words is "one hundred two billion, one hundred twelve million, one hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •