Base | Representation |
---|---|
bin | 1110001100010100000… |
… | …10001111000010010100 |
3 | 1201121200222010201101022 |
4 | 13012022002033002110 |
5 | 30442200132134012 |
6 | 1012004430420312 |
7 | 50142231231206 |
oct | 7061202170224 |
9 | 1647628121338 |
10 | 487647146132 |
11 | 1788a0112563 |
12 | 7a614061698 |
13 | 36ca5b710a3 |
14 | 198607d4776 |
15 | ca41413472 |
hex | 718a08f094 |
487647146132 has 6 divisors (see below), whose sum is σ = 853382505738. Its totient is φ = 243823573064.
The previous prime is 487647146123. The next prime is 487647146137. The reversal of 487647146132 is 231641746784.
It can be written as a sum of positive squares in only one way, i.e., 267944957956 + 219702188176 = 517634^2 + 468724^2 .
It is a super-2 number, since 2×4876471461322 (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 (487647146137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60955893263 + ... + 60955893270.
It is an arithmetic number, because the mean of its divisors is an integer number (142230417623).
Almost surely, 2487647146132 is an apocalyptic number.
It is an amenable number.
487647146132 is a deficient number, since it is larger than the sum of its proper divisors (365735359606).
487647146132 is a wasteful number, since it uses less digits than its factorization.
487647146132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121911786537 (or 121911786535 counting only the distinct ones).
The product of its digits is 5419008, while the sum is 53.
The spelling of 487647146132 in words is "four hundred eighty-seven billion, six hundred forty-seven million, one hundred forty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •