Base | Representation |
---|---|
bin | 100011100100000111110… |
… | …0011010010100010100000 |
3 | 122022021121111120211102120 |
4 | 1013020033203102202200 |
5 | 1120040442011121224 |
6 | 14221252530344240 |
7 | 1013066360601243 |
oct | 107101743224240 |
9 | 18267544524376 |
10 | 4887933692064 |
11 | 1614a63160745 |
12 | 66b39312b080 |
13 | 295c12774b57 |
14 | 12c811da725a |
15 | 8722e019779 |
hex | 4720f8d28a0 |
4887933692064 has 48 divisors (see below), whose sum is σ = 12833407292832. Its totient is φ = 1628983440128.
The previous prime is 4887933692041. The next prime is 4887933692069. The reversal of 4887933692064 is 4602963397884.
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 4887933692064.
It is not an unprimeable number, because it can be changed into a prime (4887933692069) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4641834 + ... + 5596649.
It is an arithmetic number, because the mean of its divisors is an integer number (267362651934).
Almost surely, 24887933692064 is an apocalyptic number.
It is an amenable number.
4887933692064 is an abundant number, since it is smaller than the sum of its proper divisors (7945473600768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4887933692064 is a wasteful number, since it uses less digits than its factorization.
4887933692064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10243469 (or 10243461 counting only the distinct ones).
The product of its (nonzero) digits is 376233984, while the sum is 69.
The spelling of 4887933692064 in words is "four trillion, eight hundred eighty-seven billion, nine hundred thirty-three million, six hundred ninety-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •