Base | Representation |
---|---|
bin | 101111010110010110… |
… | …0000111000000000000 |
3 | 100201110100122222121000 |
4 | 1132230230013000000 |
5 | 3131220430220333 |
6 | 114413431132000 |
7 | 10226522264310 |
oct | 1365454070000 |
9 | 321410588530 |
10 | 101681491968 |
11 | 3a139607991 |
12 | 17858b14000 |
13 | 9785ca89c4 |
14 | 4cc84c9440 |
15 | 29a1b84713 |
hex | 17acb07000 |
101681491968 has 832 divisors, whose sum is σ = 375763763200. Its totient is φ = 26515537920.
The previous prime is 101681491921. The next prime is 101681491973. The reversal of 101681491968 is 869194186101.
101681491968 is a `hidden beast` number, since 1 + 0 + 1 + 68 + 1 + 491 + 96 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 455970705 + ... + 455970927.
Almost surely, 2101681491968 is an apocalyptic number.
101681491968 is a gapful number since it is divisible by the number (18) 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 101681491968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187881881600).
101681491968 is an abundant number, since it is smaller than the sum of its proper divisors (274082271232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101681491968 is a wasteful number, since it uses less digits than its factorization.
101681491968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313 (or 285 counting only the distinct ones).
The product of its (nonzero) digits is 746496, while the sum is 54.
The spelling of 101681491968 in words is "one hundred one billion, six hundred eighty-one million, four hundred ninety-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •