Base | Representation |
---|---|
bin | 1100000101110… |
… | …01010000101101 |
3 | 21001211210000000 |
4 | 12002321100231 |
5 | 201431002000 |
6 | 14021454513 |
7 | 2341034220 |
oct | 602712055 |
9 | 231753000 |
10 | 101422125 |
11 | 52282a42 |
12 | 29b71439 |
13 | 18020bbc |
14 | d6815b7 |
15 | 8d86000 |
hex | 60b942d |
101422125 has 128 divisors (see below), whose sum is σ = 221045760. Its totient is φ = 45489600.
The previous prime is 101422117. The next prime is 101422127. The reversal of 101422125 is 521224101.
It is not a de Polignac number, because 101422125 - 23 = 101422117 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101422098 and 101422107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101422127) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1913599 + ... + 1913651.
It is an arithmetic number, because the mean of its divisors is an integer number (1726920).
Almost surely, 2101422125 is an apocalyptic number.
101422125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101422125 is an abundant number, since it is smaller than the sum of its proper divisors (119623635).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101422125 is an frugal number, since it uses more digits than its factorization.
101422125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96 (or 68 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 101422125 is about 10070.8552268415. The cubic root of 101422125 is about 466.3488411322.
Adding to 101422125 its reverse (521224101), we get a palindrome (622646226).
The spelling of 101422125 in words is "one hundred one million, four hundred twenty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •