Base | Representation |
---|---|
bin | 11001011001000… |
… | …011111010001101 |
3 | 1002200121001011021 |
4 | 121121003322031 |
5 | 1333024000023 |
6 | 110134354141 |
7 | 13361640355 |
oct | 3131037215 |
9 | 1080531137 |
10 | 426000013 |
11 | 1a951412a |
12 | ba7bb951 |
13 | 6a345a1a |
14 | 40811b65 |
15 | 275ec35d |
hex | 19643e8d |
426000013 has 8 divisors (see below), whose sum is σ = 434748600. Its totient is φ = 417339648.
The previous prime is 425999999. The next prime is 426000017. The reversal of 426000013 is 310000624.
It can be written as a sum of positive squares in 4 ways, for example, as 87366409 + 338633604 = 9347^2 + 18402^2 .
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 426000013 - 29 = 425999501 is a prime.
It is a super-2 number, since 2×4260000132 = 362952022152000338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (426000017) 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, 12256 + ... + 31657.
It is an arithmetic number, because the mean of its divisors is an integer number (54343575).
Almost surely, 2426000013 is an apocalyptic number.
It is an amenable number.
426000013 is a deficient number, since it is larger than the sum of its proper divisors (8748587).
426000013 is a wasteful number, since it uses less digits than its factorization.
426000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44111.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 426000013 is about 20639.7677554763. The cubic root of 426000013 is about 752.4365280180.
Adding to 426000013 its reverse (310000624), we get a palindrome (736000637).
The spelling of 426000013 in words is "four hundred twenty-six million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •