Base | Representation |
---|---|
bin | 101111000011001000… |
… | …1011111001011111100 |
3 | 100122210102220022221010 |
4 | 1132012101133023330 |
5 | 3123410431311230 |
6 | 114225445035220 |
7 | 10204535102502 |
oct | 1360621371374 |
9 | 318712808833 |
10 | 101036978940 |
11 | 39938816797 |
12 | 176b90b5b10 |
13 | 96b25c6351 |
14 | 4c66a76672 |
15 | 29652c29b0 |
hex | 178645f2fc |
101036978940 has 48 divisors (see below), whose sum is σ = 284538850848. Its totient is φ = 26787450624.
The previous prime is 101036978899. The next prime is 101036978947. The reversal of 101036978940 is 49879630101.
It is a happy number.
It is a super-2 number, since 2×1010369789402 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101036978940.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101036978947) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4856527 + ... + 4877286.
It is an arithmetic number, because the mean of its divisors is an integer number (5927892726).
Almost surely, 2101036978940 is an apocalyptic number.
101036978940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101036978940 is an abundant number, since it is smaller than the sum of its proper divisors (183501871908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101036978940 is a wasteful number, since it uses less digits than its factorization.
101036978940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9733998 (or 9733996 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 48.
The spelling of 101036978940 in words is "one hundred one billion, thirty-six million, nine hundred seventy-eight thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •