Base | Representation |
---|---|
bin | 101110110111100100… |
… | …0101000011011110100 |
3 | 100121210101102212020020 |
4 | 1131233020220123310 |
5 | 3122112042002211 |
6 | 114123140405140 |
7 | 10162112345631 |
oct | 1355710503364 |
9 | 317711385206 |
10 | 100648781556 |
11 | 39759682304 |
12 | 1760b0a67b0 |
13 | 9650057c5b |
14 | 4c2b2a5188 |
15 | 2941191306 |
hex | 176f2286f4 |
100648781556 has 12 divisors (see below), whose sum is σ = 234847156992. Its totient is φ = 33549593848.
The previous prime is 100648781521. The next prime is 100648781591. The reversal of 100648781556 is 655187846001.
It is an interprime number because it is at equal distance from previous prime (100648781521) and next prime (100648781591).
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1006487815562 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100648781499 and 100648781508.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4193699220 + ... + 4193699243.
It is an arithmetic number, because the mean of its divisors is an integer number (19570596416).
Almost surely, 2100648781556 is an apocalyptic number.
It is an amenable number.
100648781556 is an abundant number, since it is smaller than the sum of its proper divisors (134198375436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100648781556 is a wasteful number, since it uses less digits than its factorization.
100648781556 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8387398470 (or 8387398468 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 51.
The spelling of 100648781556 in words is "one hundred billion, six hundred forty-eight million, seven hundred eighty-one thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •