Base | Representation |
---|---|
bin | 10010110100111000… |
… | …00000000000000000 |
3 | 222002101112011220000 |
4 | 21122130000000000 |
5 | 131144422132224 |
6 | 4350532520000 |
7 | 505315662360 |
oct | 113234000000 |
9 | 28071464800 |
10 | 10107224064 |
11 | 43172a0043 |
12 | 1b60a80000 |
13 | c50c90172 |
14 | 6bc4b49a0 |
15 | 3e24dd0c9 |
hex | 25a700000 |
10107224064 has 420 divisors, whose sum is σ = 36540759024. Its totient is φ = 2717908992.
The previous prime is 10107224063. The next prime is 10107224069. The reversal of 10107224064 is 46042270101.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10107224063) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 594542584 + ... + 594542600.
Almost surely, 210107224064 is an apocalyptic number.
10107224064 is a gapful number since it is divisible by the number (14) 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 10107224064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18270379512).
10107224064 is an abundant number, since it is smaller than the sum of its proper divisors (26433534960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10107224064 is an frugal number, since it uses more digits than its factorization.
10107224064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76 (or 29 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
Adding to 10107224064 its reverse (46042270101), we get a palindrome (56149494165).
The spelling of 10107224064 in words is "ten billion, one hundred seven million, two hundred twenty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •