Base | Representation |
---|---|
bin | 1100011010111011… |
… | …10010111101000000 |
3 | 122012201201001221220 |
4 | 12031131302331000 |
5 | 102124100200012 |
6 | 3021410115040 |
7 | 324151113135 |
oct | 61535627500 |
9 | 18181631856 |
10 | 6668365632 |
11 | 2912133885 |
12 | 136127ba80 |
13 | 8236b02a6 |
14 | 4738b058c |
15 | 29065c08c |
hex | 18d772f40 |
6668365632 has 56 divisors (see below), whose sum is σ = 17782373376. Its totient is φ = 2205278208.
The previous prime is 6668365631. The next prime is 6668365633. The reversal of 6668365632 is 2365638666.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (6668365631) and next prime (6668365633).
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6668365631) 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 7 ways as a sum of consecutive naturals, for example, 112353 + ... + 161120.
Almost surely, 26668365632 is an apocalyptic number.
It is an amenable number.
6668365632 is an abundant number, since it is smaller than the sum of its proper divisors (11114007744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6668365632 is a wasteful number, since it uses less digits than its factorization.
6668365632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273615 (or 273605 counting only the distinct ones).
The product of its digits is 5598720, while the sum is 51.
The square root of 6668365632 is about 81660.0614253994. The cubic root of 6668365632 is about 1882.2319229416.
The spelling of 6668365632 in words is "six billion, six hundred sixty-eight million, three hundred sixty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •