Base | Representation |
---|---|
bin | 1100000011010… |
… | …01101111101000 |
3 | 21001020020020000 |
4 | 12001221233220 |
5 | 201340041144 |
6 | 14010503000 |
7 | 2335206522 |
oct | 601515750 |
9 | 231206200 |
10 | 101096424 |
11 | 52080270 |
12 | 29a34a60 |
13 | 17c38890 |
14 | d5d8a12 |
15 | 8d1e769 |
hex | 6069be8 |
101096424 has 160 divisors (see below), whose sum is σ = 332972640. Its totient is φ = 28252800.
The previous prime is 101096417. The next prime is 101096449. The reversal of 101096424 is 424690101.
101096424 is a `hidden beast` number, since 1 + 0 + 10 + 9 + 642 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 92119 + ... + 93209.
It is an arithmetic number, because the mean of its divisors is an integer number (2081079).
Almost surely, 2101096424 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101096424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166486320).
101096424 is an abundant number, since it is smaller than the sum of its proper divisors (231876216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101096424 is a wasteful number, since it uses less digits than its factorization.
101096424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1133 (or 1120 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 101096424 is about 10054.6717499877. The cubic root of 101096424 is about 465.8491041334.
The spelling of 101096424 in words is "one hundred one million, ninety-six thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •