Base | Representation |
---|---|
bin | 110000100000010010011100… |
… | …1101000100101101101111011 |
3 | 2001221122100120100121220012202 |
4 | 1201000210321220211231323 |
5 | 421410213433101134230 |
6 | 4111224210531300415 |
7 | 155603312014466330 |
oct | 14100447150455573 |
9 | 2057570510556182 |
10 | 426650133224315 |
11 | 113a4233a506070 |
12 | 3ba277a244a70b |
13 | 1540ac20065a40 |
14 | 774dd95c28987 |
15 | 344d2381c8a45 |
hex | 1840939a25b7b |
426650133224315 has 128 divisors (see below), whose sum is σ = 709644935430144. Its totient is φ = 237566582208000.
The previous prime is 426650133224291. The next prime is 426650133224339. The reversal of 426650133224315 is 513422331056624.
It is an interprime number because it is at equal distance from previous prime (426650133224291) and next prime (426650133224339).
It is not a de Polignac number, because 426650133224315 - 222 = 426650129030011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 426650133224315.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2080681184 + ... + 2080886226.
It is an arithmetic number, because the mean of its divisors is an integer number (5544101058048).
Almost surely, 2426650133224315 is an apocalyptic number.
426650133224315 is a deficient number, since it is larger than the sum of its proper divisors (282994802205829).
426650133224315 is a wasteful number, since it uses less digits than its factorization.
426650133224315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218521.
The product of its (nonzero) digits is 3110400, while the sum is 47.
The spelling of 426650133224315 in words is "four hundred twenty-six trillion, six hundred fifty billion, one hundred thirty-three million, two hundred twenty-four thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •