Base | Representation |
---|---|
bin | 11001011010110… |
… | …110111001000110 |
3 | 1002201110222012120 |
4 | 121122312321012 |
5 | 1333134032412 |
6 | 110152430410 |
7 | 13365641430 |
oct | 3132667106 |
9 | 1081428176 |
10 | 426470982 |
11 | 1a9805a63 |
12 | ba9a8406 |
13 | 6a47c1c2 |
14 | 408d5650 |
15 | 27691b8c |
hex | 196b6e46 |
426470982 has 16 divisors (see below), whose sum is σ = 974790912. Its totient is φ = 121848840.
The previous prime is 426470977. The next prime is 426470987. The reversal of 426470982 is 289074624.
It is an interprime number because it is at equal distance from previous prime (426470977) and next prime (426470987).
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 10154071 = 426470982 / (4 + 2 + 6 + 4 + 7 + 0 + 9 + 8 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (426470987) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5076994 + ... + 5077077.
It is an arithmetic number, because the mean of its divisors is an integer number (60924432).
Almost surely, 2426470982 is an apocalyptic number.
426470982 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
426470982 is an abundant number, since it is smaller than the sum of its proper divisors (548319930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426470982 is a wasteful number, since it uses less digits than its factorization.
426470982 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10154083.
The product of its (nonzero) digits is 193536, while the sum is 42.
The square root of 426470982 is about 20651.1738649405. The cubic root of 426470982 is about 752.7137140543.
The spelling of 426470982 in words is "four hundred twenty-six million, four hundred seventy thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •