Base | Representation |
---|---|
bin | 11001011100011… |
… | …110111011010001 |
3 | 1002202021121201220 |
4 | 121130132323101 |
5 | 1333241201410 |
6 | 110205515253 |
7 | 13402364655 |
oct | 3134367321 |
9 | 1082247656 |
10 | 426897105 |
11 | 1a9a77128 |
12 | bab72b29 |
13 | 6a59b14b |
14 | 409a6a65 |
15 | 27728070 |
hex | 1971eed1 |
426897105 has 8 divisors (see below), whose sum is σ = 683035392. Its totient is φ = 227678448.
The previous prime is 426897103. The next prime is 426897113. The reversal of 426897105 is 501798624.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 426897105 - 21 = 426897103 is a prime.
It is a super-3 number, since 3×4268971053 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (426897103) 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, 14229889 + ... + 14229918.
It is an arithmetic number, because the mean of its divisors is an integer number (85379424).
Almost surely, 2426897105 is an apocalyptic number.
It is an amenable number.
426897105 is a deficient number, since it is larger than the sum of its proper divisors (256138287).
426897105 is a wasteful number, since it uses less digits than its factorization.
426897105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28459815.
The product of its (nonzero) digits is 120960, while the sum is 42.
The square root of 426897105 is about 20661.4884507385. The cubic root of 426897105 is about 752.9643304462.
It can be divided in two parts, 42689 and 7105, that added together give a palindrome (49794).
The spelling of 426897105 in words is "four hundred twenty-six million, eight hundred ninety-seven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •