Base | Representation |
---|---|
bin | 10010111110011011… |
… | …10111101011111000 |
3 | 222021222101211221000 |
4 | 21133031313223320 |
5 | 131330433443242 |
6 | 4402515245000 |
7 | 510311344224 |
oct | 113715675370 |
9 | 28258354830 |
10 | 10187406072 |
11 | 4358585a68 |
12 | 1b838a9760 |
13 | c6478533c |
14 | 6c8dc7784 |
15 | 3e957aa4c |
hex | 25f377af8 |
10187406072 has 64 divisors (see below), whose sum is σ = 28395108000. Its totient is φ = 3384191232.
The previous prime is 10187406071. The next prime is 10187406083. The reversal of 10187406072 is 27060478101.
10187406072 is a `hidden beast` number, since 1 + 0 + 1 + 8 + 7 + 40 + 607 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10187406071) 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, 17197 + ... + 143772.
Almost surely, 210187406072 is an apocalyptic number.
10187406072 is a gapful number since it is divisible by the number (12) 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 10187406072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14197554000).
10187406072 is an abundant number, since it is smaller than the sum of its proper divisors (18207701928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10187406072 is a wasteful number, since it uses less digits than its factorization.
10187406072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161277 (or 161267 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 36.
The spelling of 10187406072 in words is "ten billion, one hundred eighty-seven million, four hundred six thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •