Base | Representation |
---|---|
bin | 10011000010100011… |
… | …11010011000011000 |
3 | 222101101112102110210 |
4 | 21201101322120120 |
5 | 131413314120440 |
6 | 4410153211120 |
7 | 511211510634 |
oct | 114121723030 |
9 | 28341472423 |
10 | 10222020120 |
11 | 4376078014 |
12 | 1b93400aa0 |
13 | c6b9b4520 |
14 | 6cd837dc4 |
15 | 3ec616a80 |
hex | 26147a618 |
10222020120 has 128 divisors (see below), whose sum is σ = 33352482240. Its totient is φ = 2491238400.
The previous prime is 10222020103. The next prime is 10222020143. The reversal of 10222020120 is 2102022201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10222020096 and 10222020105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 125122 + ... + 189998.
Almost surely, 210222020120 is an apocalyptic number.
10222020120 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 10222020120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16676241120).
10222020120 is an abundant number, since it is smaller than the sum of its proper divisors (23130462120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222020120 is a wasteful number, since it uses less digits than its factorization.
10222020120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65005 (or 65001 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10222020120 its reverse (2102022201), we get a palindrome (12324042321).
The spelling of 10222020120 in words is "ten billion, two hundred twenty-two million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •