Base | Representation |
---|---|
bin | 10011011001111101… |
… | …01000110101101100 |
3 | 222220001212011210100 |
4 | 21230332220311230 |
5 | 132314040402444 |
6 | 4441444111100 |
7 | 516114016230 |
oct | 115476506554 |
9 | 28801764710 |
10 | 10418294124 |
11 | 4466945637 |
12 | 2029095490 |
13 | ca05658a4 |
14 | 70b92a5c0 |
15 | 40e986e69 |
hex | 26cfa8d6c |
10418294124 has 144 divisors (see below), whose sum is σ = 31315787776. Its totient is φ = 2857680000.
The previous prime is 10418294123. The next prime is 10418294137. The reversal of 10418294124 is 42149281401.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (10418294123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 986874 + ... + 997374.
Almost surely, 210418294124 is an apocalyptic number.
10418294124 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 10418294124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15657893888).
10418294124 is an abundant number, since it is smaller than the sum of its proper divisors (20897493652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10418294124 is a wasteful number, since it uses less digits than its factorization.
10418294124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10676 (or 10671 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
The spelling of 10418294124 in words is "ten billion, four hundred eighteen million, two hundred ninety-four thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •