Base | Representation |
---|---|
bin | 111101001000011111001… |
… | …110110110001010000001 |
3 | 112212121112001102022102122 |
4 | 331020133032312022001 |
5 | 1022312123003013100 |
6 | 12533525204254025 |
7 | 612340513553654 |
oct | 75103716661201 |
9 | 15777461368378 |
10 | 4201002001025 |
11 | 137a6a9122a95 |
12 | 57a2230a1315 |
13 | 2461ca8a580b |
14 | 10748852d89b |
15 | 744273a8985 |
hex | 3d21f3b6281 |
4201002001025 has 24 divisors (see below), whose sum is σ = 5488033430880. Its totient is φ = 3181234556160.
The previous prime is 4201002001019. The next prime is 4201002001109. The reversal of 4201002001025 is 5201002001024.
4201002001025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4201002001025 - 210 = 4201002000001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4201002000994 and 4201002001012.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3161624 + ... + 4289273.
It is an arithmetic number, because the mean of its divisors is an integer number (228668059620).
Almost surely, 24201002001025 is an apocalyptic number.
It is an amenable number.
4201002001025 is a deficient number, since it is larger than the sum of its proper divisors (1287031429855).
4201002001025 is a wasteful number, since it uses less digits than its factorization.
4201002001025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7452113 (or 7452108 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 17.
Adding to 4201002001025 its reverse (5201002001024), we get a palindrome (9402004002049).
Subtracting 4201002001025 from its reverse (5201002001024), we obtain a palindrome (999999999999).
The spelling of 4201002001025 in words is "four trillion, two hundred one billion, two million, one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •