Base | Representation |
---|---|
bin | 1010011011101100… |
… | …00111111001000001 |
3 | 112110100021022222102 |
4 | 11031312013321001 |
5 | 42432324013100 |
6 | 2323440520145 |
7 | 255540503024 |
oct | 51566077101 |
9 | 15410238872 |
10 | 5601001025 |
11 | 2414689a74 |
12 | 1103920055 |
13 | 6b3517cb9 |
14 | 3b1c291bb |
15 | 22bac0cd5 |
hex | 14dd87e41 |
5601001025 has 12 divisors (see below), whose sum is σ = 6951493692. Its totient is φ = 4476767040.
The previous prime is 5601001019. The next prime is 5601001027. The reversal of 5601001025 is 5201001065.
It can be written as a sum of positive squares in 6 ways, for example, as 360544144 + 5240456881 = 18988^2 + 72391^2 .
It is not a de Polignac number, because 5601001025 - 210 = 5601000001 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 = 5601000988 and 5601001006.
It is not an unprimeable number, because it can be changed into a prime (5601001027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72362 + ... + 128211.
It is an arithmetic number, because the mean of its divisors is an integer number (579291141).
Almost surely, 25601001025 is an apocalyptic number.
It is an amenable number.
5601001025 is a deficient number, since it is larger than the sum of its proper divisors (1350492667).
5601001025 is a wasteful number, since it uses less digits than its factorization.
5601001025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201700 (or 201695 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 5601001025 is about 74839.8358162282. The cubic root of 5601001025 is about 1775.9138083839.
The spelling of 5601001025 in words is "five billion, six hundred one million, one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •