Base | Representation |
---|---|
bin | 10010110101100110… |
… | …01101110111111000 |
3 | 222002210222101111110 |
4 | 21122303031313320 |
5 | 131203001411300 |
6 | 4351311200320 |
7 | 505421501250 |
oct | 113263156770 |
9 | 28083871443 |
10 | 10113310200 |
11 | 431a777704 |
12 | 1b62b160a0 |
13 | c52311426 |
14 | 6bd21a960 |
15 | 3e2ce1550 |
hex | 25accddf8 |
10113310200 has 384 divisors, whose sum is σ = 38183270400. Its totient is φ = 2161582080.
The previous prime is 10113310189. The next prime is 10113310237. The reversal of 10113310200 is 201331101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 14065441 + ... + 14066159.
It is an arithmetic number, because the mean of its divisors is an integer number (99435600).
Almost surely, 210113310200 is an apocalyptic number.
10113310200 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 10113310200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19091635200).
10113310200 is an abundant number, since it is smaller than the sum of its proper divisors (28069960200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113310200 is a wasteful number, since it uses less digits than its factorization.
10113310200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 959 (or 950 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10113310200 its reverse (201331101), we get a palindrome (10314641301).
The spelling of 10113310200 in words is "ten billion, one hundred thirteen million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •