Base | Representation |
---|---|
bin | 10110110001011110111100… |
… | …100110001011111111111010 |
3 | 111010121222000211120212221221 |
4 | 112301132330212023333322 |
5 | 101111440033131041100 |
6 | 553003420121422254 |
7 | 30045066244262002 |
oct | 2661367446137772 |
9 | 433558024525857 |
10 | 100157506502650 |
11 | 29a05618357923 |
12 | b29724233a98a |
13 | 43b6a7391c13c |
14 | 1aa39134c9002 |
15 | b8a4d73b801a |
hex | 5b17bc98bffa |
100157506502650 has 12 divisors (see below), whose sum is σ = 186292962095022. Its totient is φ = 40063002601040.
The previous prime is 100157506502621. The next prime is 100157506502657. The reversal of 100157506502650 is 56205605751001.
It can be written as a sum of positive squares in 3 ways, for example, as 67575683116249 + 32581823386401 = 8220443^2 + 5708049^2 .
It is a super-2 number, since 2×1001575065026502 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100157506502597 and 100157506502606.
It is not an unprimeable number, because it can be changed into a prime (100157506502657) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1001575064977 + ... + 1001575065076.
Almost surely, 2100157506502650 is an apocalyptic number.
100157506502650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100157506502650 is a deficient number, since it is larger than the sum of its proper divisors (86135455592372).
100157506502650 is a wasteful number, since it uses less digits than its factorization.
100157506502650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2003150130065 (or 2003150130060 counting only the distinct ones).
The product of its (nonzero) digits is 315000, while the sum is 43.
The spelling of 100157506502650 in words is "one hundred trillion, one hundred fifty-seven billion, five hundred six million, five hundred two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •