Base | Representation |
---|---|
bin | 100101110101111001111… |
… | …1000000111001010000001 |
3 | 200102012200202211201220200 |
4 | 1023223303320013022001 |
5 | 1140203123003013100 |
6 | 15021150214555413 |
7 | 1044521451403005 |
oct | 113536370071201 |
9 | 20365622751820 |
10 | 5201002001025 |
11 | 1725807048986 |
12 | 6bbba5068b69 |
13 | 2b95b5b7134c |
14 | 13da30976705 |
15 | 90453b1ee00 |
hex | 4baf3e07281 |
5201002001025 has 18 divisors (see below), whose sum is σ = 9315572473350. Its totient is φ = 2773867733760.
The previous prime is 5201002000921. The next prime is 5201002001029.
5201002001025 is a `hidden beast` number, since 520 + 100 + 20 + 0 + 1 + 0 + 25 = 666.
5201002001025 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 3 ways, for example, as 430451463744 + 4770550537281 = 656088^2 + 2184159^2 .
It is not a de Polignac number, because 5201002001025 - 27 = 5201002000897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5201002000989 and 5201002001007.
It is not an unprimeable number, because it can be changed into a prime (5201002001029) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 11557782000 + ... + 11557782449.
It is an arithmetic number, because the mean of its divisors is an integer number (517531804075).
Almost surely, 25201002001025 is an apocalyptic number.
It is an amenable number.
5201002001025 is a deficient number, since it is larger than the sum of its proper divisors (4114570472325).
5201002001025 is a wasteful number, since it uses less digits than its factorization.
5201002001025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23115564465 (or 23115564457 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The spelling of 5201002001025 in words is "five trillion, two hundred one billion, two million, one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •