Base | Representation |
---|---|
bin | 10011010100010111… |
… | …10011001011011100 |
3 | 222202210122100120022 |
4 | 21222023303023130 |
5 | 132220040201300 |
6 | 4433051211312 |
7 | 515004360545 |
oct | 115213631334 |
9 | 28683570508 |
10 | 10371412700 |
11 | 4442434960 |
12 | 2015446b38 |
13 | c9392cabc |
14 | 7056054cc |
15 | 40a7c6285 |
hex | 26a2f32dc |
10371412700 has 144 divisors (see below), whose sum is σ = 26836282368. Its totient is φ = 3434880000.
The previous prime is 10371412693. The next prime is 10371412721. The reversal of 10371412700 is 721417301.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10371412700.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 570755 + ... + 588645.
It is an arithmetic number, because the mean of its divisors is an integer number (186363072).
Almost surely, 210371412700 is an apocalyptic number.
10371412700 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 10371412700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13418141184).
10371412700 is an abundant number, since it is smaller than the sum of its proper divisors (16464869668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10371412700 is a wasteful number, since it uses less digits than its factorization.
10371412700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17964 (or 17957 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 26.
The spelling of 10371412700 in words is "ten billion, three hundred seventy-one million, four hundred twelve thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •