Base | Representation |
---|---|
bin | 100100011000010011101… |
… | …0010010110100011111101 |
3 | 122200222212200002201120021 |
4 | 1020300213102112203331 |
5 | 1123410000232224343 |
6 | 14344545131052141 |
7 | 1024144454504641 |
oct | 110604722264375 |
9 | 18628780081507 |
10 | 5000001054973 |
11 | 1658541278141 |
12 | 68904a2a1051 |
13 | 2a3662373502 |
14 | 13400397cc21 |
15 | 8a0dc87e0ed |
hex | 48c274968fd |
5000001054973 has 2 divisors, whose sum is σ = 5000001054974. Its totient is φ = 5000001054972.
The previous prime is 5000001054953. The next prime is 5000001055039. The reversal of 5000001054973 is 3794501000005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4660534015929 + 339467039044 = 2158827^2 + 582638^2 .
It is a cyclic number.
It is not a de Polignac number, because 5000001054973 - 241 = 2800977799421 is a prime.
It is a super-2 number, since 2×50000010549732 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5000001054953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500000527486 + 2500000527487.
It is an arithmetic number, because the mean of its divisors is an integer number (2500000527487).
Almost surely, 25000001054973 is an apocalyptic number.
It is an amenable number.
5000001054973 is a deficient number, since it is larger than the sum of its proper divisors (1).
5000001054973 is an equidigital number, since it uses as much as digits as its factorization.
5000001054973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 34.
Adding to 5000001054973 its reverse (3794501000005), we get a palindrome (8794502054978).
The spelling of 5000001054973 in words is "five trillion, one million, fifty-four thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •