Base | Representation |
---|---|
bin | 100100100100000100000… |
… | …1111110101001100100101 |
3 | 122210102001022122022112222 |
4 | 1021020020033311030211 |
5 | 1124313203011312401 |
6 | 14404322405522125 |
7 | 1026030245051033 |
oct | 111101017651445 |
9 | 18712038568488 |
10 | 5025250104101 |
11 | 1668218748497 |
12 | 691b16113345 |
13 | 2a5b57378676 |
14 | 13531b035553 |
15 | 8aab9348c1b |
hex | 492083f5325 |
5025250104101 has 8 divisors (see below), whose sum is σ = 5038664408064. Its totient is φ = 5011849387440.
The previous prime is 5025250104073. The next prime is 5025250104143. The reversal of 5025250104101 is 1014010525205.
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 5025250104101 - 226 = 5025182995237 is a prime.
It is a super-2 number, since 2×50252501041012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5025250104181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2655926 + ... + 4135751.
It is an arithmetic number, because the mean of its divisors is an integer number (629833051008).
Almost surely, 25025250104101 is an apocalyptic number.
It is an amenable number.
5025250104101 is a deficient number, since it is larger than the sum of its proper divisors (13414303963).
5025250104101 is a wasteful number, since it uses less digits than its factorization.
5025250104101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6793651.
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 5025250104101 its reverse (1014010525205), we get a palindrome (6039260629306).
The spelling of 5025250104101 in words is "five trillion, twenty-five billion, two hundred fifty million, one hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •