Base | Representation |
---|---|
bin | 100100011000010101010… |
… | …0100010111111110011001 |
3 | 122201000000111200212020102 |
4 | 1020300222210113332121 |
5 | 1123410103331023001 |
6 | 14344554415105145 |
7 | 1024146023461100 |
oct | 110605244277631 |
9 | 18630014625212 |
10 | 5000056111001 |
11 | 165856a361596 |
12 | 6890648121b5 |
13 | 2a36708ac043 |
14 | 13400add1037 |
15 | 8a0e2606e6b |
hex | 48c2a917f99 |
5000056111001 has 6 divisors (see below), whose sum is σ = 5816391802650. Its totient is φ = 4285762380816.
The previous prime is 5000056110989. The next prime is 5000056111007. The reversal of 5000056111001 is 1001116500005.
It can be written as a sum of positive squares in only one way, i.e., 4517427179776 + 482628931225 = 2125424^2 + 694715^2 .
It is not a de Polignac number, because 5000056111001 - 230 = 4998982369177 is a prime.
It is a super-2 number, since 2×50000561110012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5000056111007) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 51020980676 + ... + 51020980773.
It is an arithmetic number, because the mean of its divisors is an integer number (969398633775).
Almost surely, 25000056111001 is an apocalyptic number.
It is an amenable number.
5000056111001 is a deficient number, since it is larger than the sum of its proper divisors (816335691649).
5000056111001 is a wasteful number, since it uses less digits than its factorization.
5000056111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102041961463 (or 102041961456 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 5000056111001 in words is "five trillion, fifty-six million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •