Base | Representation |
---|---|
bin | 111100010110011… |
… | …0100011110100001 |
3 | 12020010102102122000 |
4 | 1320230310132201 |
5 | 13121400441301 |
6 | 532535034213 |
7 | 101116226256 |
oct | 17054643641 |
9 | 5203372560 |
10 | 2025015201 |
11 | 94a082990 |
12 | 48620b969 |
13 | 2636c5461 |
14 | 152d2b42d |
15 | bcba4786 |
hex | 78b347a1 |
2025015201 has 32 divisors (see below), whose sum is σ = 3378339840. Its totient is φ = 1187686800.
The previous prime is 2025015173. The next prime is 2025015203. The reversal of 2025015201 is 1025105202.
2025015201 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2025015201 - 27 = 2025015073 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2025015203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100765 + ... + 119178.
It is an arithmetic number, because the mean of its divisors is an integer number (105573120).
Almost surely, 22025015201 is an apocalyptic number.
It is an amenable number.
2025015201 is a deficient number, since it is larger than the sum of its proper divisors (1353324639).
2025015201 is a wasteful number, since it uses less digits than its factorization.
2025015201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219994 (or 219988 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 2025015201 is about 45000.1688996830. The cubic root of 2025015201 is about 1265.1521636286.
Subtracting from 2025015201 its reverse (1025105202), we obtain a palindrome (999909999).
It can be divided in two parts, 202501 and 5201, that added together give a palindrome (207702).
The spelling of 2025015201 in words is "two billion, twenty-five million, fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •