Base | Representation |
---|---|
bin | 111011101001111… |
… | …1110011111011001 |
3 | 12011111121012000211 |
4 | 1313103332133121 |
5 | 13044420203101 |
6 | 530343531121 |
7 | 100414246054 |
oct | 16723763731 |
9 | 5144535024 |
10 | 2001725401 |
11 | 937a15a15 |
12 | 47a459aa1 |
13 | 25b92c800 |
14 | 14dbc7a9b |
15 | bab03c51 |
hex | 774fe7d9 |
2001725401 has 12 divisors (see below), whose sum is σ = 2295054972. Its totient is φ = 1739053056.
The previous prime is 2001725399. The next prime is 2001725413. The reversal of 2001725401 is 1045271002.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 279558400 + 1722167001 = 16720^2 + 41499^2 .
It is not a de Polignac number, because 2001725401 - 21 = 2001725399 is a prime.
It is a super-2 number, since 2×20017254012 = 8013809162017221602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2001725491) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 345496 + ... + 351241.
It is an arithmetic number, because the mean of its divisors is an integer number (191254581).
Almost surely, 22001725401 is an apocalyptic number.
It is an amenable number.
2001725401 is a deficient number, since it is larger than the sum of its proper divisors (293329571).
2001725401 is a wasteful number, since it uses less digits than its factorization.
2001725401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 696780 (or 696767 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 2001725401 is about 44740.6459609157. The cubic root of 2001725401 is about 1260.2832572626.
Adding to 2001725401 its reverse (1045271002), we get a palindrome (3046996403).
The spelling of 2001725401 in words is "two billion, one million, seven hundred twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •