Base | Representation |
---|---|
bin | 10010110111100110… |
… | …10011101001111100 |
3 | 222010222120222000000 |
4 | 21123303103221330 |
5 | 131221302023400 |
6 | 4353111234300 |
7 | 506014344414 |
oct | 113363235174 |
9 | 28128528000 |
10 | 10130111100 |
11 | 432920244a |
12 | 1b68678990 |
13 | c559446a5 |
14 | 6c1551644 |
15 | 3e450e600 |
hex | 25bcd3a7c |
10130111100 has 126 divisors (see below), whose sum is σ = 32958671760. Its totient is φ = 2701343520.
The previous prime is 10130111093. The next prime is 10130111197. The reversal of 10130111100 is 111103101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 3421 + ... + 142379.
It is an arithmetic number, because the mean of its divisors is an integer number (261576760).
Almost surely, 210130111100 is an apocalyptic number.
10130111100 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 10130111100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16479335880).
10130111100 is an abundant number, since it is smaller than the sum of its proper divisors (22828560660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130111100 is a wasteful number, since it uses less digits than its factorization.
10130111100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138991 (or 138969 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 10130111100 its reverse (111103101), we get a palindrome (10241214201).
The spelling of 10130111100 in words is "ten billion, one hundred thirty million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •