Base | Representation |
---|---|
bin | 100100011101011100111… |
… | …1001000001101010010001 |
3 | 122202001101201202211022121 |
4 | 1020322321321001222101 |
5 | 1124100112423213410 |
6 | 14354013405134241 |
7 | 1025015335215103 |
oct | 110727171015221 |
9 | 18661351684277 |
10 | 5011050601105 |
11 | 16621a147674a |
12 | 68b21285a381 |
13 | 2a47036277a3 |
14 | 134771269573 |
15 | 8a5379589da |
hex | 48eb9e41a91 |
5011050601105 has 8 divisors (see below), whose sum is σ = 6016371576552. Its totient is φ = 4006766577408.
The previous prime is 5011050601079. The next prime is 5011050601121. The reversal of 5011050601105 is 5011060501105.
It can be written as a sum of positive squares in 4 ways, for example, as 2437795086336 + 2573255514769 = 1561344^2 + 1604137^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5011050601105 - 211 = 5011050599057 is a prime.
It is a super-2 number, since 2×50110506011052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5011050601105.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 259227304 + ... + 259246633.
It is an arithmetic number, because the mean of its divisors is an integer number (752046447069).
Almost surely, 25011050601105 is an apocalyptic number.
It is an amenable number.
5011050601105 is a deficient number, since it is larger than the sum of its proper divisors (1005320975447).
5011050601105 is a wasteful number, since it uses less digits than its factorization.
5011050601105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 518475875.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 5011050601105 in words is "five trillion, eleven billion, fifty million, six hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •