Base | Representation |
---|---|
bin | 1110001010100101100… |
… | …00000011010010000000 |
3 | 1201112022022212010220000 |
4 | 13011102300003102000 |
5 | 30433300211220022 |
6 | 1011332414520000 |
7 | 50110236420651 |
oct | 7052260032200 |
9 | 1645268763800 |
10 | 486719632512 |
11 | 1784645a8883 |
12 | 7a3b5506000 |
13 | 36b88963369 |
14 | 197b3555528 |
15 | c9d9c9e6ac |
hex | 7152c03480 |
486719632512 has 80 divisors (see below), whose sum is σ = 1448469770550. Its totient is φ = 162239874048.
The previous prime is 486719632507. The next prime is 486719632513. The reversal of 486719632512 is 215236917684.
It is a happy number.
486719632512 is a `hidden beast` number, since 4 + 8 + 6 + 7 + 1 + 96 + 32 + 512 = 666.
It can be written as a sum of positive squares in only one way, i.e., 444227582016 + 42492050496 = 666504^2 + 206136^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (486719632513) 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 9 ways as a sum of consecutive naturals, for example, 23461837 + ... + 23482572.
Almost surely, 2486719632512 is an apocalyptic number.
It is an amenable number.
486719632512 is an abundant number, since it is smaller than the sum of its proper divisors (961750138038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
486719632512 is an equidigital number, since it uses as much as digits as its factorization.
486719632512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46944435 (or 46944414 counting only the distinct ones).
The product of its digits is 4354560, while the sum is 54.
The spelling of 486719632512 in words is "four hundred eighty-six billion, seven hundred nineteen million, six hundred thirty-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •