Base | Representation |
---|---|
bin | 1110001100010100011… |
… | …01111011100000100000 |
3 | 1201121201011220110210020 |
4 | 13012022031323200200 |
5 | 30442201423234442 |
6 | 1012005020233440 |
7 | 50142266260215 |
oct | 7061215734040 |
9 | 1647634813706 |
10 | 487650211872 |
11 | 1788a191692a |
12 | 7a61509b880 |
13 | 36ca66a5635 |
14 | 19860d91b0c |
15 | ca4181b9ec |
hex | 718a37b820 |
487650211872 has 96 divisors (see below), whose sum is σ = 1315137426624. Its totient is φ = 158101632000.
The previous prime is 487650211861. The next prime is 487650211889. The reversal of 487650211872 is 278112056784.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 10850247 + ... + 10895097.
It is an arithmetic number, because the mean of its divisors is an integer number (13699348194).
Almost surely, 2487650211872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 487650211872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (657568713312).
487650211872 is an abundant number, since it is smaller than the sum of its proper divisors (827487214752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
487650211872 is a wasteful number, since it uses less digits than its factorization.
487650211872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47962 (or 47954 counting only the distinct ones).
The product of its (nonzero) digits is 1505280, while the sum is 51.
The spelling of 487650211872 in words is "four hundred eighty-seven billion, six hundred fifty million, two hundred eleven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •