Base | Representation |
---|---|
bin | 10011000010100011… |
… | …11010110111100000 |
3 | 222101101112112012120 |
4 | 21201101322313200 |
5 | 131413314201422 |
6 | 4410153224240 |
7 | 511211516511 |
oct | 114121726740 |
9 | 28341475176 |
10 | 10222022112 |
11 | 4376079565 |
12 | 1b93402080 |
13 | c6b9b53c3 |
14 | 6cd838a08 |
15 | 3ec61745c |
hex | 26147ade0 |
10222022112 has 48 divisors (see below), whose sum is σ = 27999457920. Its totient is φ = 3259194752.
The previous prime is 10222022081. The next prime is 10222022117. The reversal of 10222022112 is 21122022201.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 10222022091 and 10222022100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222022117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2312562 + ... + 2316977.
It is an arithmetic number, because the mean of its divisors is an integer number (583322040).
Almost surely, 210222022112 is an apocalyptic number.
10222022112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10222022112 is an abundant number, since it is smaller than the sum of its proper divisors (17777435808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222022112 is a wasteful number, since it uses less digits than its factorization.
10222022112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4629575 (or 4629567 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10222022112 its reverse (21122022201), we get a palindrome (31344044313).
The spelling of 10222022112 in words is "ten billion, two hundred twenty-two million, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •