Base | Representation |
---|---|
bin | 1100000101101… |
… | …01110101000110 |
3 | 21001211001201110 |
4 | 12002311311012 |
5 | 201430024240 |
6 | 14021305450 |
7 | 2340645231 |
oct | 602656506 |
9 | 231731643 |
10 | 101408070 |
11 | 52273425 |
12 | 29b65286 |
13 | 1801769a |
14 | d67a418 |
15 | 8d81c80 |
hex | 60b5d46 |
101408070 has 64 divisors (see below), whose sum is σ = 253368000. Its totient is φ = 25944576.
The previous prime is 101408053. The next prime is 101408089. The reversal of 101408070 is 70804101.
It is a super-2 number, since 2×1014080702 = 20567193322249800, which contains 22 as substring.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 198976 + ... + 199484.
It is an arithmetic number, because the mean of its divisors is an integer number (3958875).
Almost surely, 2101408070 is an apocalyptic number.
101408070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101408070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126684000).
101408070 is an abundant number, since it is smaller than the sum of its proper divisors (151959930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101408070 is a wasteful number, since it uses less digits than its factorization.
101408070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777.
The product of its (nonzero) digits is 224, while the sum is 21.
The square root of 101408070 is about 10070.1573969824. The cubic root of 101408070 is about 466.3272980493.
The spelling of 101408070 in words is "one hundred one million, four hundred eight thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •