Base | Representation |
---|---|
bin | 11011101100100… |
… | …001011010011111 |
3 | 1012101022222020122 |
4 | 123230201122133 |
5 | 1422422443111 |
6 | 114035105155 |
7 | 14341340210 |
oct | 3354413237 |
9 | 1171288218 |
10 | 464656031 |
11 | 219316a54 |
12 | 10b7421bb |
13 | 7535b8c8 |
14 | 459d5407 |
15 | 2abd5cdb |
hex | 1bb2169f |
464656031 has 8 divisors (see below), whose sum is σ = 531333120. Its totient is φ = 398053368.
The previous prime is 464655977. The next prime is 464656033. The reversal of 464656031 is 130656464.
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 464656031 - 210 = 464655007 is a prime.
It is a super-3 number, since 3×4646560313 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 464655982 and 464656000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (464656033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4511 + ... + 30816.
It is an arithmetic number, because the mean of its divisors is an integer number (66416640).
Almost surely, 2464656031 is an apocalyptic number.
464656031 is a deficient number, since it is larger than the sum of its proper divisors (66677089).
464656031 is a wasteful number, since it uses less digits than its factorization.
464656031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37213.
The product of its (nonzero) digits is 51840, while the sum is 35.
The square root of 464656031 is about 21555.8815871678. The cubic root of 464656031 is about 774.5400147951.
The spelling of 464656031 in words is "four hundred sixty-four million, six hundred fifty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •