Base | Representation |
---|---|
bin | 1100011011001100000… |
… | …01010100101001110111 |
3 | 1111210221022211222200210 |
4 | 12031212001110221313 |
5 | 23443304311310304 |
6 | 524042111240503 |
7 | 42562211620356 |
oct | 6154601245167 |
9 | 1453838758623 |
10 | 426913385079 |
11 | 155064526a05 |
12 | 6a8a4519133 |
13 | 313473b397c |
14 | 1693c6d999d |
15 | b18956ec89 |
hex | 6366054a77 |
426913385079 has 4 divisors (see below), whose sum is σ = 569217846776. Its totient is φ = 284608923384.
The previous prime is 426913385077. The next prime is 426913385161. The reversal of 426913385079 is 970583319624.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 426913385079 - 21 = 426913385077 is a prime.
It is a super-2 number, since 2×4269133850792 (a number of 24 digits) 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 (426913385077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71152230844 + ... + 71152230849.
It is an arithmetic number, because the mean of its divisors is an integer number (142304461694).
It is a 1-persistent number, because it is pandigital, but 2⋅426913385079 = 853826770158 is not.
Almost surely, 2426913385079 is an apocalyptic number.
426913385079 is a deficient number, since it is larger than the sum of its proper divisors (142304461697).
426913385079 is a wasteful number, since it uses less digits than its factorization.
426913385079 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142304461696.
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 426913385079 in words is "four hundred twenty-six billion, nine hundred thirteen million, three hundred eighty-five thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •