Base | Representation |
---|---|
bin | 1100000101000… |
… | …10110001101001 |
3 | 21001200002122220 |
4 | 12002202301221 |
5 | 201420030100 |
6 | 14015504253 |
7 | 2340201546 |
oct | 602426151 |
9 | 231602586 |
10 | 101330025 |
11 | 5221a825 |
12 | 29b28089 |
13 | 17cbacc4 |
14 | d659bcd |
15 | 8d68aa0 |
hex | 60a2c69 |
101330025 has 24 divisors (see below), whose sum is σ = 168263040. Its totient is φ = 53807040.
The previous prime is 101330017. The next prime is 101330039. The reversal of 101330025 is 520033101.
It is a happy number.
It is not a de Polignac number, because 101330025 - 23 = 101330017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 101329986 and 101330013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15099 + ... + 20751.
It is an arithmetic number, because the mean of its divisors is an integer number (7010960).
Almost surely, 2101330025 is an apocalyptic number.
101330025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101330025 is a deficient number, since it is larger than the sum of its proper divisors (66933015).
101330025 is a wasteful number, since it uses less digits than its factorization.
101330025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5905 (or 5900 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 101330025 is about 10066.2815875575. The cubic root of 101330025 is about 466.2076367819.
Adding to 101330025 its reverse (520033101), we get a palindrome (621363126).
The spelling of 101330025 in words is "one hundred one million, three hundred thirty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •