Base | Representation |
---|---|
bin | 100101101000110… |
… | …101100010110000 |
3 | 1122000012121002212 |
4 | 211220311202300 |
5 | 2243123241224 |
6 | 142354231252 |
7 | 21435224162 |
oct | 4550654260 |
9 | 1560177085 |
10 | 631462064 |
11 | 2a4497882 |
12 | 157585528 |
13 | a0a931bc |
14 | 5dc16932 |
15 | 3a684d0e |
hex | 25a358b0 |
631462064 has 20 divisors (see below), whose sum is σ = 1262925120. Its totient is φ = 305545920.
The previous prime is 631462063. The next prime is 631462081. The reversal of 631462064 is 460264136.
631462064 is an admirable number.
It is a super-2 number, since 2×6314620642 = 797488676542280192, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 631462064.
It is not an unprimeable number, because it can be changed into a prime (631462063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 636059 + ... + 637050.
It is an arithmetic number, because the mean of its divisors is an integer number (63146256).
Almost surely, 2631462064 is an apocalyptic number.
It is an amenable number.
631462064 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
631462064 is a wasteful number, since it uses less digits than its factorization.
631462064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273148 (or 1273142 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
The square root of 631462064 is about 25128.9089297566. The cubic root of 631462064 is about 857.9245355391.
The spelling of 631462064 in words is "six hundred thirty-one million, four hundred sixty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •