Base | Representation |
---|---|
bin | 1100101011000… |
… | …11110100010001 |
3 | 21102001100210112 |
4 | 12111203310101 |
5 | 204204040100 |
6 | 14314411105 |
7 | 2430443225 |
oct | 625436421 |
9 | 242040715 |
10 | 106315025 |
11 | 55015063 |
12 | 2b730a95 |
13 | 19044ccb |
14 | 10196785 |
15 | 9500b35 |
hex | 6563d11 |
106315025 has 12 divisors (see below), whose sum is σ = 139585932. Its totient is φ = 80048640.
The previous prime is 106314973. The next prime is 106315031. The reversal of 106315025 is 520513601.
It can be written as a sum of positive squares in 6 ways, for example, as 163216 + 106151809 = 404^2 + 10303^2 .
It is not a de Polignac number, because 106315025 - 210 = 106314001 is a prime.
It is a super-2 number, since 2×1063150252 = 22605769081501250, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon 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 11 ways as a sum of consecutive naturals, for example, 124652 + ... + 125501.
It is an arithmetic number, because the mean of its divisors is an integer number (11632161).
Almost surely, 2106315025 is an apocalyptic number.
It is an amenable number.
106315025 is a deficient number, since it is larger than the sum of its proper divisors (33270907).
106315025 is a wasteful number, since it uses less digits than its factorization.
106315025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250180 (or 250175 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 106315025 is about 10310.9177574065. The cubic root of 106315025 is about 473.7307202491.
Adding to 106315025 its reverse (520513601), we get a palindrome (626828626).
The spelling of 106315025 in words is "one hundred six million, three hundred fifteen thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •