Base | Representation |
---|---|
bin | 10010111010000010… |
… | …00101011100010101 |
3 | 222012101221211110210 |
4 | 21131001011130111 |
5 | 131242012000432 |
6 | 4355120240033 |
7 | 506352553542 |
oct | 113501053425 |
9 | 28171854423 |
10 | 10150500117 |
11 | 4339768a7a |
12 | 1b73470019 |
13 | c59c32bb4 |
14 | 6c413bbc9 |
15 | 3e61da8cc |
hex | 25d045715 |
10150500117 has 8 divisors (see below), whose sum is σ = 13899784096. Its totient is φ = 6584108112.
The previous prime is 10150500077. The next prime is 10150500121. The reversal of 10150500117 is 71100505101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10150500117 - 26 = 10150500053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10150500093 and 10150500102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150500167) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45722863 + ... + 45723084.
It is an arithmetic number, because the mean of its divisors is an integer number (1737473012).
Almost surely, 210150500117 is an apocalyptic number.
It is an amenable number.
10150500117 is a deficient number, since it is larger than the sum of its proper divisors (3749283979).
10150500117 is an equidigital number, since it uses as much as digits as its factorization.
10150500117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91445987.
The product of its (nonzero) digits is 175, while the sum is 21.
The spelling of 10150500117 in words is "ten billion, one hundred fifty million, five hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •