Base | Representation |
---|---|
bin | 111101100101111… |
… | …1000111110001001 |
3 | 12100000212222022200 |
4 | 1323023320332021 |
5 | 13213034331010 |
6 | 541024510413 |
7 | 102133532502 |
oct | 17313707611 |
9 | 5300788280 |
10 | 2066714505 |
11 | 970674219 |
12 | 49817b409 |
13 | 26c2355bb |
14 | 1586a3ba9 |
15 | c168ecc0 |
hex | 7b2f8f89 |
2066714505 has 24 divisors (see below), whose sum is σ = 3632765760. Its totient is φ = 1086721440.
The previous prime is 2066714491. The next prime is 2066714509. The reversal of 2066714505 is 5054176602.
It is a happy number.
2066714505 is a `hidden beast` number, since 20 + 66 + 71 + 4 + 505 = 666.
It is not a de Polignac number, because 2066714505 - 218 = 2066452361 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2066714505.
It is not an unprimeable number, because it can be changed into a prime (2066714509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 320235 + ... + 326624.
It is an arithmetic number, because the mean of its divisors is an integer number (151365240).
Almost surely, 22066714505 is an apocalyptic number.
It is an amenable number.
2066714505 is a deficient number, since it is larger than the sum of its proper divisors (1566051255).
2066714505 is a wasteful number, since it uses less digits than its factorization.
2066714505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646941 (or 646938 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 2066714505 is about 45461.1318050926. The cubic root of 2066714505 is about 1273.7772729911. Note that the first 3 decimals are identical.
The spelling of 2066714505 in words is "two billion, sixty-six million, seven hundred fourteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •