Base | Representation |
---|---|
bin | 10011000001001001… |
… | …00100100001100000 |
3 | 222100120011112221021 |
4 | 21200210210201200 |
5 | 131402243242422 |
6 | 4405050335224 |
7 | 511005464563 |
oct | 114044444140 |
9 | 28316145837 |
10 | 10210134112 |
11 | 436a399972 |
12 | 1b8b42a514 |
13 | c693b2399 |
14 | 6cc0224da |
15 | 3eb569dc7 |
hex | 260924860 |
10210134112 has 96 divisors (see below), whose sum is σ = 21032524800. Its totient is φ = 4875475968.
The previous prime is 10210134107. The next prime is 10210134113. The reversal of 10210134112 is 21143101201.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210134113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11109589 + ... + 11110507.
It is an arithmetic number, because the mean of its divisors is an integer number (219088800).
Almost surely, 210210134112 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 10210134112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10516262400).
10210134112 is an abundant number, since it is smaller than the sum of its proper divisors (10822390688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210134112 is an equidigital number, since it uses as much as digits as its factorization.
10210134112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1148 (or 1140 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10210134112 its reverse (21143101201), we get a palindrome (31353235313).
The spelling of 10210134112 in words is "ten billion, two hundred ten million, one hundred thirty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •