Base | Representation |
---|---|
bin | 1110001100010011111… |
… | …11000101010111001010 |
3 | 1201121200220120202020120 |
4 | 13012021333011113022 |
5 | 30442144424220244 |
6 | 1012004401004110 |
7 | 50142221220654 |
oct | 7061177052712 |
9 | 1647626522216 |
10 | 487646320074 |
11 | 17889a6a8971 |
12 | 7a613923636 |
13 | 36ca59420b4 |
14 | 1986065b6d4 |
15 | ca412ed819 |
hex | 7189fc55ca |
487646320074 has 64 divisors (see below), whose sum is σ = 1011545812992. Its totient is φ = 156557318400.
The previous prime is 487646320069. The next prime is 487646320079. The reversal of 487646320074 is 470023646784.
It is an interprime number because it is at equal distance from previous prime (487646320069) and next prime (487646320079).
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 487646319999 and 487646320026.
It is not an unprimeable number, because it can be changed into a prime (487646320079) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 137479569 + ... + 137483115.
It is an arithmetic number, because the mean of its divisors is an integer number (15805403328).
Almost surely, 2487646320074 is an apocalyptic number.
487646320074 is an abundant number, since it is smaller than the sum of its proper divisors (523899492918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
487646320074 is a wasteful number, since it uses less digits than its factorization.
487646320074 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6891.
The product of its (nonzero) digits is 5419008, while the sum is 51.
The spelling of 487646320074 in words is "four hundred eighty-seven billion, six hundred forty-six million, three hundred twenty thousand, seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •