Base | Representation |
---|---|
bin | 1100011001111110001… |
… | …01011101111010000101 |
3 | 1111202020210200201112021 |
4 | 12030333011131322011 |
5 | 23440440100111013 |
6 | 523453214323141 |
7 | 42540060402433 |
oct | 6147705357205 |
9 | 1452223621467 |
10 | 426260160133 |
11 | 154859825385 |
12 | 6a7417b94b1 |
13 | 31271c70b32 |
14 | 168b9a59d53 |
15 | b14c03ba8d |
hex | 633f15de85 |
426260160133 has 8 divisors (see below), whose sum is σ = 427776251000. Its totient is φ = 424745754048.
The previous prime is 426260160127. The next prime is 426260160229. The reversal of 426260160133 is 331061062624.
It can be written as a sum of positive squares in 4 ways, for example, as 357583668289 + 68676491844 = 597983^2 + 262062^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 426260160133 - 217 = 426260029061 is a prime.
It is a super-2 number, since 2×4262601601332 (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 (426260161133) 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, 86803 + ... + 927391.
It is an arithmetic number, because the mean of its divisors is an integer number (53472031375).
Almost surely, 2426260160133 is an apocalyptic number.
It is an amenable number.
426260160133 is a deficient number, since it is larger than the sum of its proper divisors (1516090867).
426260160133 is a wasteful number, since it uses less digits than its factorization.
426260160133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 842391.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 426260160133 in words is "four hundred twenty-six billion, two hundred sixty million, one hundred sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •