Base | Representation |
---|---|
bin | 1100001001101… |
… | …00011001100000 |
3 | 21002210101212102 |
4 | 12010310121200 |
5 | 202043121441 |
6 | 14040345532 |
7 | 2345234540 |
oct | 604643140 |
9 | 232711772 |
10 | 101926496 |
11 | 52597981 |
12 | 2a1752a8 |
13 | 18169649 |
14 | d773320 |
15 | 8e3569b |
hex | 6134660 |
101926496 has 48 divisors (see below), whose sum is σ = 230265504. Its totient is φ = 43505664.
The previous prime is 101926477. The next prime is 101926499. The reversal of 101926496 is 694629101.
It is a nialpdrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101926499) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64856 + ... + 66408.
It is an arithmetic number, because the mean of its divisors is an integer number (4797198).
Almost surely, 2101926496 is an apocalyptic number.
101926496 is a gapful number since it is divisible by the number (16) 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 101926496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115132752).
101926496 is an abundant number, since it is smaller than the sum of its proper divisors (128339008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101926496 is a wasteful number, since it uses less digits than its factorization.
101926496 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1863 (or 1855 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 38.
The square root of 101926496 is about 10095.8652922867. The cubic root of 101926496 is about 467.1206122538.
The spelling of 101926496 in words is "one hundred one million, nine hundred twenty-six thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •