Base | Representation |
---|---|
bin | 100101000100011111101… |
… | …0001000001011010000000 |
3 | 200001001210211100200200200 |
4 | 1022020333101001122000 |
5 | 1131433320003433442 |
6 | 14500321131045200 |
7 | 1034044121614650 |
oct | 112107721013200 |
9 | 20031724320620 |
10 | 5094892639872 |
11 | 1694806087382 |
12 | 6a35112a0800 |
13 | 2ac5a5725509 |
14 | 13884639a360 |
15 | 8c7e339934c |
hex | 4a23f441680 |
5094892639872 has 96 divisors (see below), whose sum is σ = 16755524928480. Its totient is φ = 1455683609088.
The previous prime is 5094892639861. The next prime is 5094892639891. The reversal of 5094892639872 is 2789362984905.
5094892639872 is a `hidden beast` number, since 5 + 0 + 9 + 489 + 2 + 63 + 9 + 87 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a self number, because there is not a number n which added to its sum of digits gives 5094892639872.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 315895498 + ... + 315911625.
It is an arithmetic number, because the mean of its divisors is an integer number (174536718005).
Almost surely, 25094892639872 is an apocalyptic number.
It is an amenable number.
5094892639872 is an abundant number, since it is smaller than the sum of its proper divisors (11660632288608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5094892639872 is a wasteful number, since it uses less digits than its factorization.
5094892639872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 631807150 (or 631807135 counting only the distinct ones).
The product of its (nonzero) digits is 470292480, while the sum is 72.
The spelling of 5094892639872 in words is "five trillion, ninety-four billion, eight hundred ninety-two million, six hundred thirty-nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •