Base | Representation |
---|---|
bin | 111101100100100… |
… | …1010111000101101 |
3 | 12022222112202012100 |
4 | 1323021022320231 |
5 | 13212344021303 |
6 | 541001325313 |
7 | 102124502565 |
oct | 17311127055 |
9 | 5288482170 |
10 | 2066001453 |
11 | 97022751a |
12 | 497a96839 |
13 | 26c045b89 |
14 | 158559da5 |
15 | c159d8a3 |
hex | 7b24ae2d |
2066001453 has 12 divisors (see below), whose sum is σ = 2995001308. Its totient is φ = 1372360320.
The previous prime is 2066001437. The next prime is 2066001463. The reversal of 2066001453 is 3541006602.
2066001453 is a `hidden beast` number, since 2 + 0 + 6 + 600 + 1 + 4 + 53 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 350550729 + 1715450724 = 18723^2 + 41418^2 .
It is not a de Polignac number, because 2066001453 - 24 = 2066001437 is a prime.
It is a super-2 number, since 2×20660014532 = 8536724007596222418, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2066001463) 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 11 ways as a sum of consecutive naturals, for example, 411868 + ... + 416853.
Almost surely, 22066001453 is an apocalyptic number.
It is an amenable number.
2066001453 is a deficient number, since it is larger than the sum of its proper divisors (928999855).
2066001453 is a wasteful number, since it uses less digits than its factorization.
2066001453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 829004 (or 829001 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 2066001453 is about 45453.2886928988. The cubic root of 2066001453 is about 1273.6307644617.
The spelling of 2066001453 in words is "two billion, sixty-six million, one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •