Base | Representation |
---|---|
bin | 100111010110101… |
… | …100011001001111 |
3 | 1201000101201001001 |
4 | 213112230121033 |
5 | 2323011313211 |
6 | 145303401131 |
7 | 22235056345 |
oct | 4726543117 |
9 | 1630351031 |
10 | 660260431 |
11 | 309777486 |
12 | 1651531a7 |
13 | a6a3725c |
14 | 63991995 |
15 | 3ce72ac1 |
hex | 275ac64f |
660260431 has 8 divisors (see below), whose sum is σ = 695427200. Its totient is φ = 625135320.
The previous prime is 660260423. The next prime is 660260437. The reversal of 660260431 is 134062066.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 660260431 - 23 = 660260423 is a prime.
It is a super-2 number, since 2×6602604312 = 871887673488611522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 660260431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (660260437) 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, 25300 + ... + 44278.
It is an arithmetic number, because the mean of its divisors is an integer number (86928400).
Almost surely, 2660260431 is an apocalyptic number.
660260431 is a deficient number, since it is larger than the sum of its proper divisors (35166769).
660260431 is a wasteful number, since it uses less digits than its factorization.
660260431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20829.
The product of its (nonzero) digits is 5184, while the sum is 28.
The square root of 660260431 is about 25695.5332888812. The cubic root of 660260431 is about 870.7732725094.
The spelling of 660260431 in words is "six hundred sixty million, two hundred sixty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •