Base | Representation |
---|---|
bin | 101110110100111101… |
… | …1011011110111111101 |
3 | 100121120022002020212110 |
4 | 1131221323123313331 |
5 | 3121422211424112 |
6 | 114110340324233 |
7 | 10160002050420 |
oct | 1355173336775 |
9 | 317508066773 |
10 | 100561436157 |
11 | 39714344426 |
12 | 175a59a3679 |
13 | 9637c253a0 |
14 | 4c1d8499b7 |
15 | 293868b13c |
hex | 1769edbdfd |
100561436157 has 32 divisors (see below), whose sum is σ = 165101932800. Its totient is φ = 53018311680.
The previous prime is 100561436117. The next prime is 100561436159. The reversal of 100561436157 is 751634165001.
It is not a de Polignac number, because 100561436157 - 28 = 100561435901 is a prime.
It is a super-2 number, since 2×1005614361572 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100561436159) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 498469 + ... + 670517.
It is an arithmetic number, because the mean of its divisors is an integer number (5159435400).
Almost surely, 2100561436157 is an apocalyptic number.
It is an amenable number.
100561436157 is a deficient number, since it is larger than the sum of its proper divisors (64540496643).
100561436157 is a wasteful number, since it uses less digits than its factorization.
100561436157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174213.
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 100561436157 in words is "one hundred billion, five hundred sixty-one million, four hundred thirty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •