Base | Representation |
---|---|
bin | 101111011101000001… |
… | …1010000000000000000 |
3 | 100202000222111000000000 |
4 | 1132322003100000000 |
5 | 3132200322140302 |
6 | 114452000000000 |
7 | 10235213556153 |
oct | 1367203200000 |
9 | 322028430000 |
10 | 101905661952 |
11 | 3a2440a9136 |
12 | 17900000000 |
13 | 97c0576473 |
14 | 4d0a19dc9a |
15 | 29b66b531c |
hex | 17ba0d0000 |
101905661952 has 340 divisors, whose sum is σ = 309579216320. Its totient is φ = 33538572288.
The previous prime is 101905661939. The next prime is 101905661993. The reversal of 101905661952 is 259166509101.
It is a happy number.
101905661952 is a `hidden beast` number, since 10 + 19 + 0 + 5 + 6 + 619 + 5 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 101905661898 and 101905661907.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1289945049 + ... + 1289945127.
Almost surely, 2101905661952 is an apocalyptic number.
101905661952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101905661952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154789608160).
101905661952 is an abundant number, since it is smaller than the sum of its proper divisors (207673554368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101905661952 is an frugal number, since it uses more digits than its factorization.
101905661952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138 (or 84 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 45.
The spelling of 101905661952 in words is "one hundred one billion, nine hundred five million, six hundred sixty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •