Base | Representation |
---|---|
bin | 11001011011100… |
… | …110001011011001 |
3 | 1002201211210220000 |
4 | 121123212023121 |
5 | 1333211232130 |
6 | 110200523213 |
7 | 13400406210 |
oct | 3133461331 |
9 | 1081753800 |
10 | 426664665 |
11 | 1a9928529 |
12 | baa80509 |
13 | 6a5193cb |
14 | 40946077 |
15 | 276ce260 |
hex | 196e62d9 |
426664665 has 120 divisors (see below), whose sum is σ = 930557760. Its totient is φ = 182704896.
The previous prime is 426664663. The next prime is 426664673. The reversal of 426664665 is 566466624.
It is not a de Polignac number, because 426664665 - 21 = 426664663 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 426664665.
It is not an unprimeable number, because it can be changed into a prime (426664661) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 4793941 + ... + 4794029.
It is an arithmetic number, because the mean of its divisors is an integer number (7754648).
Almost surely, 2426664665 is an apocalyptic number.
426664665 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
426664665 is an abundant number, since it is smaller than the sum of its proper divisors (503893095).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426664665 is an equidigital number, since it uses as much as digits as its factorization.
426664665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221 (or 123 counting only the distinct ones).
The product of its digits is 1244160, while the sum is 45.
The square root of 426664665 is about 20655.8627270807. The cubic root of 426664665 is about 752.8276458277.
The spelling of 426664665 in words is "four hundred twenty-six million, six hundred sixty-four thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •