Base | Representation |
---|---|
bin | 1100000011010… |
… | …10110111100001 |
3 | 21001020110112102 |
4 | 12001222313201 |
5 | 201340213100 |
6 | 14010540145 |
7 | 2335226114 |
oct | 601526741 |
9 | 231213472 |
10 | 101101025 |
11 | 52083773 |
12 | 29a37655 |
13 | 17c3a9bc |
14 | d5da57b |
15 | 8d20cd5 |
hex | 606ade1 |
101101025 has 6 divisors (see below), whose sum is σ = 125365302. Its totient is φ = 80880800.
The previous prime is 101101009. The next prime is 101101061. The reversal of 101101025 is 520101101.
It can be written as a sum of positive squares in 3 ways, for example, as 25080064 + 76020961 = 5008^2 + 8719^2 .
It is not a de Polignac number, because 101101025 - 24 = 101101009 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101100997 and 101101015.
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 5 ways as a sum of consecutive naturals, for example, 2021996 + ... + 2022045.
It is an arithmetic number, because the mean of its divisors is an integer number (20894217).
Almost surely, 2101101025 is an apocalyptic number.
It is an amenable number.
101101025 is a deficient number, since it is larger than the sum of its proper divisors (24264277).
101101025 is an equidigital number, since it uses as much as digits as its factorization.
101101025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4044051 (or 4044046 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 11.
The square root of 101101025 is about 10054.9005464997. The cubic root of 101101025 is about 465.8561711134.
Adding to 101101025 its reverse (520101101), we get a palindrome (621202126).
The spelling of 101101025 in words is "one hundred one million, one hundred one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •