Base | Representation |
---|---|
bin | 1111101001100111… |
… | …0010000101000101 |
3 | 101211210001002122202 |
4 | 3322121302011011 |
5 | 32100433001400 |
6 | 1532511204245 |
7 | 206051305166 |
oct | 37231620505 |
9 | 11753032582 |
10 | 4201062725 |
11 | 1866432672 |
12 | 992b16685 |
13 | 51c48b642 |
14 | 2bbd3176d |
15 | 198c3e4d5 |
hex | fa672145 |
4201062725 has 12 divisors (see below), whose sum is σ = 5263025124. Its totient is φ = 3326200320.
The previous prime is 4201062713. The next prime is 4201062731. The reversal of 4201062725 is 5272601024.
It is a happy number.
4201062725 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 457703236 + 3743359489 = 21394^2 + 61183^2 .
It is not a de Polignac number, because 4201062725 - 216 = 4200997189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 863774 + ... + 868623.
It is an arithmetic number, because the mean of its divisors is an integer number (438585427).
Almost surely, 24201062725 is an apocalyptic number.
It is an amenable number.
4201062725 is a deficient number, since it is larger than the sum of its proper divisors (1061962399).
4201062725 is a wasteful number, since it uses less digits than its factorization.
4201062725 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1732504 (or 1732499 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 29.
The square root of 4201062725 is about 64815.6055668695. The cubic root of 4201062725 is about 1613.5647163706.
Adding to 4201062725 its reverse (5272601024), we get a palindrome (9473663749).
The spelling of 4201062725 in words is "four billion, two hundred one million, sixty-two thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •