Base | Representation |
---|---|
bin | 100100011101100110010… |
… | …1010011001110100000010 |
3 | 122202002012200101010101010 |
4 | 1020323030222121310002 |
5 | 1124101234034104403 |
6 | 14354104535221350 |
7 | 1025026211133465 |
oct | 110731452316402 |
9 | 18662180333333 |
10 | 5011365534978 |
11 | 1662343220180 |
12 | 68b2a0217856 |
13 | 2a4753953aaa |
14 | 1347a10092dc |
15 | 8a555417603 |
hex | 48ecca99d02 |
5011365534978 has 64 divisors (see below), whose sum is σ = 10976769644544. Its totient is φ = 1512641280000.
The previous prime is 5011365534961. The next prime is 5011365534979. The reversal of 5011365534978 is 8794355631105.
It is a super-2 number, since 2×50113655349782 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (5011365534979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 252566338 + ... + 252586178.
It is an arithmetic number, because the mean of its divisors is an integer number (171512025696).
Almost surely, 25011365534978 is an apocalyptic number.
5011365534978 is an abundant number, since it is smaller than the sum of its proper divisors (5965404109566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5011365534978 is a wasteful number, since it uses less digits than its factorization.
5011365534978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34671.
The product of its (nonzero) digits is 13608000, while the sum is 57.
The spelling of 5011365534978 in words is "five trillion, eleven billion, three hundred sixty-five million, five hundred thirty-four thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •