Base | Representation |
---|---|
bin | 11000000010011… |
… | …11010011100001 |
3 | 112001102221202022 |
4 | 30001033103201 |
5 | 403110321200 |
6 | 32002031225 |
7 | 4666003013 |
oct | 1401172341 |
9 | 461387668 |
10 | 201651425 |
11 | a3910778 |
12 | 57648515 |
13 | 32a14b91 |
14 | 1cad21b3 |
15 | 12a83885 |
hex | c04f4e1 |
201651425 has 6 divisors (see below), whose sum is σ = 250047798. Its totient is φ = 161321120.
The previous prime is 201651409. The next prime is 201651469. The reversal of 201651425 is 524156102.
It can be written as a sum of positive squares in 3 ways, for example, as 20802721 + 180848704 = 4561^2 + 13448^2 .
It is not a de Polignac number, because 201651425 - 24 = 201651409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201651394 and 201651403.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4033004 + ... + 4033053.
It is an arithmetic number, because the mean of its divisors is an integer number (41674633).
Almost surely, 2201651425 is an apocalyptic number.
201651425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
201651425 is a deficient number, since it is larger than the sum of its proper divisors (48396373).
201651425 is an equidigital number, since it uses as much as digits as its factorization.
201651425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8066067 (or 8066062 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 201651425 is about 14200.4022830341. The cubic root of 201651425 is about 586.4087362994.
It can be divided in two parts, 2016 and 51425, that multiplied together give a triangular number (103672800 = T14399).
The spelling of 201651425 in words is "two hundred one million, six hundred fifty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •