Base | Representation |
---|---|
bin | 110001101101111… |
… | …1000101100011001 |
3 | 11022021010002221022 |
4 | 1203123320230121 |
5 | 11404033120424 |
6 | 433312252225 |
7 | 56224633466 |
oct | 14333705431 |
9 | 4267102838 |
10 | 1668254489 |
11 | 786760320 |
12 | 3a6841075 |
13 | 207812c45 |
14 | 11b7c066d |
15 | 9b6d295e |
hex | 636f8b19 |
1668254489 has 16 divisors (see below), whose sum is σ = 1928287296. Its totient is φ = 1426406400.
The previous prime is 1668254479. The next prime is 1668254501. The reversal of 1668254489 is 9844528661.
It is a cyclic number.
It is not a de Polignac number, because 1668254489 - 220 = 1667205913 is a prime.
It is a super-2 number, since 2×16682544892 = 5566146080137302242, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1668254489.
It is not an unprimeable number, because it can be changed into a prime (1668254449) 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 15 ways as a sum of consecutive naturals, for example, 450134 + ... + 453824.
It is an arithmetic number, because the mean of its divisors is an integer number (120517956).
Almost surely, 21668254489 is an apocalyptic number.
It is an amenable number.
1668254489 is a deficient number, since it is larger than the sum of its proper divisors (260032807).
1668254489 is a wasteful number, since it uses less digits than its factorization.
1668254489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6136.
The product of its digits is 3317760, while the sum is 53.
The square root of 1668254489 is about 40844.2711894826. The cubic root of 1668254489 is about 1186.0074963008.
The spelling of 1668254489 in words is "one billion, six hundred sixty-eight million, two hundred fifty-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •