Base | Representation |
---|---|
bin | 10110110110000100000000… |
… | …111100000001001011001101 |
3 | 111011202001021100222211111110 |
4 | 112312010000330001023031 |
5 | 101132114014014020111 |
6 | 553404141312442233 |
7 | 30106606265235354 |
oct | 2666040074011315 |
9 | 434661240884443 |
10 | 100472185688781 |
11 | 2a017018575a05 |
12 | b328223849379 |
13 | 440a64298c2aa |
14 | 1ab4c45dc099b |
15 | b937a361a5a6 |
hex | 5b6100f012cd |
100472185688781 has 32 divisors (see below), whose sum is σ = 134750474956800. Its totient is φ = 66588658678080.
The previous prime is 100472185688747. The next prime is 100472185688789. The reversal of 100472185688781 is 187886581274001.
It is not a de Polignac number, because 100472185688781 - 230 = 100471111946957 is a prime.
It is a super-2 number, since 2×1004721856887812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100472185688789) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 3354985050 + ... + 3355014996.
It is an arithmetic number, because the mean of its divisors is an integer number (4210952342400).
Almost surely, 2100472185688781 is an apocalyptic number.
It is an amenable number.
100472185688781 is a deficient number, since it is larger than the sum of its proper divisors (34278289268019).
100472185688781 is a wasteful number, since it uses less digits than its factorization.
100472185688781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37929.
The product of its (nonzero) digits is 48168960, while the sum is 66.
The spelling of 100472185688781 in words is "one hundred trillion, four hundred seventy-two billion, one hundred eighty-five million, six hundred eighty-eight thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •