Base | Representation |
---|---|
bin | 111100111101001… |
… | …0010101011100001 |
3 | 12021112122020001210 |
4 | 1321322102223201 |
5 | 13142100332001 |
6 | 534542220333 |
7 | 101453652510 |
oct | 17172225341 |
9 | 5245566053 |
10 | 2045324001 |
11 | 95a594216 |
12 | 490b846a9 |
13 | 2679862b6 |
14 | 1558d6677 |
15 | be866dd6 |
hex | 79e92ae1 |
2045324001 has 32 divisors (see below), whose sum is σ = 3165011968. Its totient is φ = 1150692480.
The previous prime is 2045323997. The next prime is 2045324011. The reversal of 2045324001 is 1004235402.
It is not a de Polignac number, because 2045324001 - 22 = 2045323997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2045324011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1389696 + ... + 1391166.
It is an arithmetic number, because the mean of its divisors is an integer number (98906624).
Almost surely, 22045324001 is an apocalyptic number.
2045324001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2045324001 is a deficient number, since it is larger than the sum of its proper divisors (1119687967).
2045324001 is a wasteful number, since it uses less digits than its factorization.
2045324001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2461.
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 2045324001 is about 45225.2584403893. The cubic root of 2045324001 is about 1269.3674906470.
Adding to 2045324001 its reverse (1004235402), we get a palindrome (3049559403).
The spelling of 2045324001 in words is "two billion, forty-five million, three hundred twenty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •