Base | Representation |
---|---|
bin | 100111111000101… |
… | …010000011111000 |
3 | 1201122011001010021 |
4 | 213320222003320 |
5 | 2332301220033 |
6 | 150222300224 |
7 | 22403540530 |
oct | 4770520370 |
9 | 1648131107 |
10 | 669163768 |
11 | 3137a8709 |
12 | 168127674 |
13 | a88338c0 |
14 | 64c2c4c0 |
15 | 3db30b2d |
hex | 27e2a0f8 |
669163768 has 128 divisors (see below), whose sum is σ = 1612800000. Its totient is φ = 253186560.
The previous prime is 669163727. The next prime is 669163783. The reversal of 669163768 is 867361966.
669163768 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3362533 + ... + 3362731.
It is an arithmetic number, because the mean of its divisors is an integer number (12600000).
Almost surely, 2669163768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 669163768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (806400000).
669163768 is an abundant number, since it is smaller than the sum of its proper divisors (943636232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
669163768 is a wasteful number, since it uses less digits than its factorization.
669163768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405 (or 401 counting only the distinct ones).
The product of its digits is 1959552, while the sum is 52.
The square root of 669163768 is about 25868.1999373748. The cubic root of 669163768 is about 874.6698152286.
The spelling of 669163768 in words is "six hundred sixty-nine million, one hundred sixty-three thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •