Base | Representation |
---|---|
bin | 100111110100101… |
… | …001001010001110 |
3 | 1201120011120200110 |
4 | 213310221022032 |
5 | 2332014032002 |
6 | 150143540450 |
7 | 22361565642 |
oct | 4764511216 |
9 | 1646146613 |
10 | 668111502 |
11 | 31314a073 |
12 | 1678ba726 |
13 | a8555966 |
14 | 64a36c22 |
15 | 3d9c3e6c |
hex | 27d2928e |
668111502 has 8 divisors (see below), whose sum is σ = 1336223016. Its totient is φ = 222703832.
The previous prime is 668111489. The next prime is 668111503. The reversal of 668111502 is 205111866.
668111502 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
668111502 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 668111502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (668111503) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55675953 + ... + 55675964.
It is an arithmetic number, because the mean of its divisors is an integer number (167027877).
Almost surely, 2668111502 is an apocalyptic number.
668111502 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668111502 is a wasteful number, since it uses less digits than its factorization.
668111502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111351922.
The product of its (nonzero) digits is 2880, while the sum is 30.
The square root of 668111502 is about 25847.8529475854. The cubic root of 668111502 is about 874.2110993349.
The spelling of 668111502 in words is "six hundred sixty-eight million, one hundred eleven thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •