Base | Representation |
---|---|
bin | 10011011001100101… |
… | …01100101010000000 |
3 | 222212211222011010000 |
4 | 21230302230222000 |
5 | 132312240222112 |
6 | 4441253040000 |
7 | 516045301500 |
oct | 115462545200 |
9 | 28784864100 |
10 | 10415164032 |
11 | 44650a7989 |
12 | 2028026000 |
13 | c9ca0ac70 |
14 | 70b353a00 |
15 | 40e5697dc |
hex | 26ccaca80 |
10415164032 has 960 divisors, whose sum is σ = 41365447200. Its totient is φ = 2570932224.
The previous prime is 10415164027. The next prime is 10415164043. The reversal of 10415164032 is 23046151401.
It is a happy number.
10415164032 is a `hidden beast` number, since 1 + 0 + 4 + 15 + 1 + 640 + 3 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 10415163987 and 10415164005.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 125483863 + ... + 125483945.
Almost surely, 210415164032 is an apocalyptic number.
10415164032 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 10415164032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20682723600).
10415164032 is an abundant number, since it is smaller than the sum of its proper divisors (30950283168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10415164032 is a wasteful number, since it uses less digits than its factorization.
10415164032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155 (or 127 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 10415164032 in words is "ten billion, four hundred fifteen million, one hundred sixty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •