Base | Representation |
---|---|
bin | 100111110100100… |
… | …111000000111011 |
3 | 1201120011010122000 |
4 | 213310213000323 |
5 | 2332013241330 |
6 | 150143432043 |
7 | 22361531220 |
oct | 4764470073 |
9 | 1646133560 |
10 | 668102715 |
11 | 313143505 |
12 | 1678b5623 |
13 | a8551967 |
14 | 64a33947 |
15 | 3d9c1560 |
hex | 27d2703b |
668102715 has 32 divisors (see below), whose sum is σ = 1357416960. Its totient is φ = 305417952.
The previous prime is 668102713. The next prime is 668102717. The reversal of 668102715 is 517201866.
It is an interprime number because it is at equal distance from previous prime (668102713) and next prime (668102717).
It is not a de Polignac number, because 668102715 - 21 = 668102713 is a prime.
It is a super-2 number, since 2×6681027152 = 892722475580742450, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 668102715.
It is not an unprimeable number, because it can be changed into a prime (668102713) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 352549 + ... + 354438.
It is an arithmetic number, because the mean of its divisors is an integer number (42419280).
Almost surely, 2668102715 is an apocalyptic number.
668102715 is an abundant number, since it is smaller than the sum of its proper divisors (689314245).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668102715 is a wasteful number, since it uses less digits than its factorization.
668102715 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 707008 (or 707002 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 668102715 is about 25847.6829715934. The cubic root of 668102715 is about 874.2072667777.
The spelling of 668102715 in words is "six hundred sixty-eight million, one hundred two thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •