Base | Representation |
---|---|
bin | 110000011111010010011000… |
… | …1111000010001011110111101 |
3 | 2001221011012110221011120112202 |
4 | 1200332210301320101132331 |
5 | 421400440212411231131 |
6 | 4111041100025041245 |
7 | 155560341641666321 |
oct | 14076446170213675 |
9 | 2057135427146482 |
10 | 426512564164541 |
11 | 113999a65347338 |
12 | 3ba04baa926225 |
13 | 153cac6800361a |
14 | 77474653d1981 |
15 | 3449885ae0bcb |
hex | 183e931e117bd |
426512564164541 has 8 divisors (see below), whose sum is σ = 426709986932064. Its totient is φ = 426315147881040.
The previous prime is 426512564164501. The next prime is 426512564164559. The reversal of 426512564164541 is 145461465215624.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-426512564164541 is a prime.
It is a super-2 number, since 2×4265125641645412 (a number of 30 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 (426512564164501) 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, 132534686 + ... + 135714656.
It is an arithmetic number, because the mean of its divisors is an integer number (53338748366508).
Almost surely, 2426512564164541 is an apocalyptic number.
It is an amenable number.
426512564164541 is a deficient number, since it is larger than the sum of its proper divisors (197422767523).
426512564164541 is a wasteful number, since it uses less digits than its factorization.
426512564164541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3242011.
The product of its digits is 27648000, while the sum is 56.
The spelling of 426512564164541 in words is "four hundred twenty-six trillion, five hundred twelve billion, five hundred sixty-four million, one hundred sixty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •