Base | Representation |
---|---|
bin | 110001101110001… |
… | …0001011100100000 |
3 | 11022021022021000020 |
4 | 1203130101130200 |
5 | 11404044341442 |
6 | 433314353440 |
7 | 56225535201 |
oct | 14334213440 |
9 | 4267267006 |
10 | 1668355872 |
11 | 78681a507 |
12 | 3a688b880 |
13 | 20784a131 |
14 | 11b8095a8 |
15 | 9b7029ec |
hex | 63711720 |
1668355872 has 48 divisors (see below), whose sum is σ = 4384078272. Its totient is φ = 555528960.
The previous prime is 1668355841. The next prime is 1668355901. The reversal of 1668355872 is 2785538661.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×16683558722 = 5566822631273760768, which contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 86997 + ... + 104427.
It is an arithmetic number, because the mean of its divisors is an integer number (91334964).
Almost surely, 21668355872 is an apocalyptic number.
1668355872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1668355872 is an abundant number, since it is smaller than the sum of its proper divisors (2715722400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1668355872 is a wasteful number, since it uses less digits than its factorization.
1668355872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18441 (or 18433 counting only the distinct ones).
The product of its digits is 2419200, while the sum is 51.
The square root of 1668355872 is about 40845.5122626709. The cubic root of 1668355872 is about 1186.0315211249.
The spelling of 1668355872 in words is "one billion, six hundred sixty-eight million, three hundred fifty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •