Base | Representation |
---|---|
bin | 101111000101010110… |
… | …0011101001001001101 |
3 | 100122222121110222112201 |
4 | 1132022230131021031 |
5 | 3124033424013300 |
6 | 114241055001501 |
7 | 10206425441143 |
oct | 1361254351115 |
9 | 318877428481 |
10 | 101111157325 |
11 | 39976681042 |
12 | 17719b09291 |
13 | 96c4a98999 |
14 | 4c72865593 |
15 | 296ba7666a |
hex | 178ab1d24d |
101111157325 has 24 divisors (see below), whose sum is σ = 130869980928. Its totient is φ = 77347807680.
The previous prime is 101111157307. The next prime is 101111157383. The reversal of 101111157325 is 523751111101.
It is not a de Polignac number, because 101111157325 - 29 = 101111156813 is a prime.
It is a super-2 number, since 2×1011111573252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101111157293 and 101111157302.
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 23 ways as a sum of consecutive naturals, for example, 1933219 + ... + 1984831.
It is an arithmetic number, because the mean of its divisors is an integer number (5452915872).
Almost surely, 2101111157325 is an apocalyptic number.
It is an amenable number.
101111157325 is a deficient number, since it is larger than the sum of its proper divisors (29758823603).
101111157325 is a wasteful number, since it uses less digits than its factorization.
101111157325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55053 (or 55048 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 28.
Adding to 101111157325 its reverse (523751111101), we get a palindrome (624862268426).
The spelling of 101111157325 in words is "one hundred one billion, one hundred eleven million, one hundred fifty-seven thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •