Base | Representation |
---|---|
bin | 1100000101101… |
… | …01000110001110 |
3 | 21001210220121100 |
4 | 12002311012032 |
5 | 201424430240 |
6 | 14021243530 |
7 | 2340633414 |
oct | 602650616 |
9 | 231726540 |
10 | 101405070 |
11 | 52271148 |
12 | 29b635a6 |
13 | 18016200 |
14 | d6792b4 |
15 | 8d80e30 |
hex | 60b518e |
101405070 has 144 divisors (see below), whose sum is σ = 292902480. Its totient is φ = 24321024.
The previous prime is 101405053. The next prime is 101405081. The reversal of 101405070 is 70504101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 897334 + ... + 897446.
It is an arithmetic number, because the mean of its divisors is an integer number (2034045).
Almost surely, 2101405070 is an apocalyptic number.
101405070 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 101405070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146451240).
101405070 is an abundant number, since it is smaller than the sum of its proper divisors (191497410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101405070 is a wasteful number, since it uses less digits than its factorization.
101405070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211 (or 195 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 101405070 is about 10070.0084409101. The cubic root of 101405070 is about 466.3226994814.
Adding to 101405070 its reverse (70504101), we get a palindrome (171909171).
The spelling of 101405070 in words is "one hundred one million, four hundred five thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •