Base | Representation |
---|---|
bin | 100100100010001110011… |
… | …1111101101001010010101 |
3 | 122210000212020220101200101 |
4 | 1021010130333231022111 |
5 | 1124232112111344000 |
6 | 14402431014414101 |
7 | 1025530401144526 |
oct | 111043477551225 |
9 | 18700766811611 |
10 | 5021303231125 |
11 | 16665828503a5 |
12 | 6911b4361331 |
13 | 2a567876877c |
14 | 135064b9084d |
15 | 8a937ab9e6a |
hex | 4911cfed295 |
5021303231125 has 8 divisors (see below), whose sum is σ = 6266586432600. Its totient is φ = 4017042584800.
The previous prime is 5021303231107. The next prime is 5021303231159. The reversal of 5021303231125 is 5211323031205.
It can be written as a sum of positive squares in 4 ways, for example, as 111081557521 + 4910221673604 = 333289^2 + 2215902^2 .
It is not a de Polignac number, because 5021303231125 - 225 = 5021269676693 is a prime.
It is a super-2 number, since 2×50213032311252 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5021303231093 and 5021303231102.
It is a congruent number.
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, 20085212800 + ... + 20085213049.
It is an arithmetic number, because the mean of its divisors is an integer number (783323304075).
Almost surely, 25021303231125 is an apocalyptic number.
It is an amenable number.
5021303231125 is a deficient number, since it is larger than the sum of its proper divisors (1245283201475).
5021303231125 is an equidigital number, since it uses as much as digits as its factorization.
5021303231125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40170425864 (or 40170425854 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The spelling of 5021303231125 in words is "five trillion, twenty-one billion, three hundred three million, two hundred thirty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •