Base | Representation |
---|---|
bin | 100101001001001100000… |
… | …0000110011100010010101 |
3 | 200002000211020111121111120 |
4 | 1022102120000303202111 |
5 | 1132114440200324243 |
6 | 14505105211554153 |
7 | 1034551644515625 |
oct | 112223000634225 |
9 | 20060736447446 |
10 | 5104971495573 |
11 | 1699008360894 |
12 | 6a546475b959 |
13 | 2b0520862261 |
14 | 139120ba8885 |
15 | 8cbd3131c83 |
hex | 4a498033895 |
5104971495573 has 4 divisors (see below), whose sum is σ = 6806628660768. Its totient is φ = 3403314330380.
The previous prime is 5104971495551. The next prime is 5104971495583. The reversal of 5104971495573 is 3755941794015.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5104971495573 - 226 = 5104904386709 is a prime.
It is a super-2 number, since 2×51049714955732 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5104971495583) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 850828582593 + ... + 850828582598.
It is an arithmetic number, because the mean of its divisors is an integer number (1701657165192).
Almost surely, 25104971495573 is an apocalyptic number.
It is an amenable number.
5104971495573 is a deficient number, since it is larger than the sum of its proper divisors (1701657165195).
5104971495573 is a wasteful number, since it uses less digits than its factorization.
5104971495573 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1701657165194.
The product of its (nonzero) digits is 23814000, while the sum is 60.
The spelling of 5104971495573 in words is "five trillion, one hundred four billion, nine hundred seventy-one million, four hundred ninety-five thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •