Base | Representation |
---|---|
bin | 10011000001001001… |
… | …00001100110000000 |
3 | 222100120010221110211 |
4 | 21200210201212000 |
5 | 131402242401422 |
6 | 4405050203504 |
7 | 511005414601 |
oct | 114044414600 |
9 | 28316127424 |
10 | 10210122112 |
11 | 436a390953 |
12 | 1b8b423594 |
13 | c693a9a98 |
14 | 6cc01bda8 |
15 | 3eb566577 |
hex | 260921980 |
10210122112 has 64 divisors (see below), whose sum is σ = 21444480000. Its totient is φ = 4828819968.
The previous prime is 10210122071. The next prime is 10210122163. The reversal of 10210122112 is 21122101201.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 10210122092 and 10210122101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1745689 + ... + 1751527.
It is an arithmetic number, because the mean of its divisors is an integer number (335070000).
Almost surely, 210210122112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10210122112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10722240000).
10210122112 is an abundant number, since it is smaller than the sum of its proper divisors (11234357888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210122112 is an equidigital number, since it uses as much as digits as its factorization.
10210122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6591 (or 6579 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10210122112 its reverse (21122101201), we get a palindrome (31332223313).
The spelling of 10210122112 in words is "ten billion, two hundred ten million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •