Base | Representation |
---|---|
bin | 11000010000000001000… |
… | …010000010111101010001 |
3 | 12220022102210012020100020 |
4 | 120100001002002331101 |
5 | 204300404420440330 |
6 | 3313321400214053 |
7 | 231253355406264 |
oct | 30200102027521 |
9 | 5808383166306 |
10 | 1666464624465 |
11 | 59281a9215a3 |
12 | 22ab7b76a329 |
13 | c11baa993b4 |
14 | 5a92b976cdb |
15 | 2d53664b210 |
hex | 18401082f51 |
1666464624465 has 32 divisors (see below), whose sum is σ = 2738511399936. Its totient is φ = 864726969600.
The previous prime is 1666464624463. The next prime is 1666464624509. The reversal of 1666464624465 is 5644264646661.
It is a happy number.
It is not a de Polignac number, because 1666464624465 - 21 = 1666464624463 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1666464624399 and 1666464624408.
It is not an unprimeable number, because it can be changed into a prime (1666464624463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22357599 + ... + 22432011.
It is an arithmetic number, because the mean of its divisors is an integer number (85578481248).
Almost surely, 21666464624465 is an apocalyptic number.
1666464624465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1666464624465 is a deficient number, since it is larger than the sum of its proper divisors (1072046775471).
1666464624465 is a wasteful number, since it uses less digits than its factorization.
1666464624465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114809.
The product of its digits is 119439360, while the sum is 60.
The spelling of 1666464624465 in words is "one trillion, six hundred sixty-six billion, four hundred sixty-four million, six hundred twenty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •