Base | Representation |
---|---|
bin | 101111000101010100… |
… | …0001110110100000011 |
3 | 100122222112101201122120 |
4 | 1132022220032310003 |
5 | 3124033133100201 |
6 | 114241015135323 |
7 | 10206413150013 |
oct | 1361250166403 |
9 | 318875351576 |
10 | 101110050051 |
11 | 39975a9513a |
12 | 17719674543 |
13 | 96c479b9aa |
14 | 4c72657c43 |
15 | 296b908536 |
hex | 178aa0ed03 |
101110050051 has 16 divisors (see below), whose sum is σ = 142751022624. Its totient is φ = 63438301184.
The previous prime is 101110050047. The next prime is 101110050091. The reversal of 101110050051 is 150050011101.
It is a cyclic number.
It is not a de Polignac number, because 101110050051 - 22 = 101110050047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101110050051.
It is not an unprimeable number, because it can be changed into a prime (101110050031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1265671 + ... + 1343183.
It is an arithmetic number, because the mean of its divisors is an integer number (8921938914).
Almost surely, 2101110050051 is an apocalyptic number.
101110050051 is a deficient number, since it is larger than the sum of its proper divisors (41640972573).
101110050051 is a wasteful number, since it uses less digits than its factorization.
101110050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103110.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 101110050051 its reverse (150050011101), we get a palindrome (251160061152).
The spelling of 101110050051 in words is "one hundred one billion, one hundred ten million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •