Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0001110110011010101 |
3 | 100122222112101201120212 |
4 | 1132022220032303111 |
5 | 3124033133100010 |
6 | 114241015135205 |
7 | 10206413146616 |
oct | 1361250166325 |
9 | 318875351525 |
10 | 101110050005 |
11 | 39975a950a8 |
12 | 17719674505 |
13 | 96c479b973 |
14 | 4c72657c0d |
15 | 296b908505 |
hex | 178aa0ecd5 |
101110050005 has 4 divisors (see below), whose sum is σ = 121332060012. Its totient is φ = 80888040000.
The previous prime is 101110049951. The next prime is 101110050023. The reversal of 101110050005 is 500050011101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 500050011101 = 761 ⋅657095941.
It can be written as a sum of positive squares in 2 ways, for example, as 37465860721 + 63644189284 = 193561^2 + 252278^2 .
It is not a de Polignac number, because 101110050005 - 28 = 101110049749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 10111004996 + ... + 10111005005.
It is an arithmetic number, because the mean of its divisors is an integer number (30333015003).
Almost surely, 2101110050005 is an apocalyptic number.
It is an amenable number.
101110050005 is a deficient number, since it is larger than the sum of its proper divisors (20222010007).
101110050005 is an equidigital number, since it uses as much as digits as its factorization.
101110050005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20222010006.
The product of its (nonzero) digits is 25, while the sum is 14.
Adding to 101110050005 its reverse (500050011101), we get a palindrome (601160061106).
The spelling of 101110050005 in words is "one hundred one billion, one hundred ten million, fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •