Base | Representation |
---|---|
bin | 10010110110000110… |
… | …01110100101000000 |
3 | 222010002212121222000 |
4 | 21123003032211000 |
5 | 131210040214032 |
6 | 4351541144000 |
7 | 505502252046 |
oct | 113303164500 |
9 | 28102777860 |
10 | 10117507392 |
11 | 4322084063 |
12 | 1b643bb000 |
13 | c53150985 |
14 | 6bd9d0396 |
15 | 3e336ee7c |
hex | 25b0ce940 |
10117507392 has 112 divisors (see below), whose sum is σ = 29885640000. Its totient is φ = 3356398080.
The previous prime is 10117507363. The next prime is 10117507399. The reversal of 10117507392 is 29370571101.
10117507392 is a `hidden beast` number, since 1 + 0 + 117 + 507 + 39 + 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 (10117507399) 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, 350734 + ... + 378482.
Almost surely, 210117507392 is an apocalyptic number.
10117507392 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 10117507392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14942820000).
10117507392 is an abundant number, since it is smaller than the sum of its proper divisors (19768132608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10117507392 is a wasteful number, since it uses less digits than its factorization.
10117507392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27981 (or 27965 counting only the distinct ones).
The product of its (nonzero) digits is 13230, while the sum is 36.
The spelling of 10117507392 in words is "ten billion, one hundred seventeen million, five hundred seven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •