Base | Representation |
---|---|
bin | 1100011011111100001… |
… | …01001110011111100101 |
3 | 1111211222110102212210020 |
4 | 12031332011032133211 |
5 | 24000121131432410 |
6 | 524150131345353 |
7 | 42605213044020 |
oct | 6157605163745 |
9 | 1454873385706 |
10 | 427317061605 |
11 | 155251383075 |
12 | 6a997752259 |
13 | 313acc11815 |
14 | 1697a17a1b7 |
15 | b1aec0ca70 |
hex | 637e14e7e5 |
427317061605 has 16 divisors (see below), whose sum is σ = 781379769984. Its totient is φ = 195344942400.
The previous prime is 427317061603. The next prime is 427317061607. The reversal of 427317061605 is 506160713724.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (427317061603) and next prime (427317061607).
It is not a de Polignac number, because 427317061605 - 21 = 427317061603 is a prime.
It is a super-2 number, since 2×4273170616052 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (427317061603) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2034843046 + ... + 2034843255.
It is an arithmetic number, because the mean of its divisors is an integer number (48836235624).
Almost surely, 2427317061605 is an apocalyptic number.
It is an amenable number.
427317061605 is a deficient number, since it is larger than the sum of its proper divisors (354062708379).
427317061605 is a wasteful number, since it uses less digits than its factorization.
427317061605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4069686316.
The product of its (nonzero) digits is 211680, while the sum is 42.
The spelling of 427317061605 in words is "four hundred twenty-seven billion, three hundred seventeen million, sixty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •