Base | Representation |
---|---|
bin | 111011110001010… |
… | …0111110000100100 |
3 | 12011202211020012220 |
4 | 1313202213300210 |
5 | 13101411030302 |
6 | 531002112340 |
7 | 100462005453 |
oct | 16742476044 |
9 | 5152736186 |
10 | 2005564452 |
11 | 93a0a8291 |
12 | 47b7ab6b0 |
13 | 25c675038 |
14 | 150506b9a |
15 | bb1114bc |
hex | 778a7c24 |
2005564452 has 12 divisors (see below), whose sum is σ = 4679650416. Its totient is φ = 668521480.
The previous prime is 2005564439. The next prime is 2005564453. The reversal of 2005564452 is 2544655002.
2005564452 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×20055644522 = 8044577542252120608, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2005564453) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83565174 + ... + 83565197.
It is an arithmetic number, because the mean of its divisors is an integer number (389970868).
Almost surely, 22005564452 is an apocalyptic number.
It is an amenable number.
2005564452 is an abundant number, since it is smaller than the sum of its proper divisors (2674085964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2005564452 is a wasteful number, since it uses less digits than its factorization.
2005564452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167130378 (or 167130376 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 33.
The square root of 2005564452 is about 44783.5288024515. The cubic root of 2005564452 is about 1261.0884296262.
The spelling of 2005564452 in words is "two billion, five million, five hundred sixty-four thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •