Base | Representation |
---|---|
bin | 100100111001011101000… |
… | …0101001011111011110001 |
3 | 122221210121111010000022222 |
4 | 1021302322011023323301 |
5 | 1131041240413043212 |
6 | 14441400334210425 |
7 | 1032244436043434 |
oct | 111627205137361 |
9 | 18853544100288 |
10 | 5071183331057 |
11 | 168574986a788 |
12 | 69a9b5053a15 |
13 | 2aa297717bbc |
14 | 1376375cd81b |
15 | 8bda6b78c72 |
hex | 49cba14bef1 |
5071183331057 has 8 divisors (see below), whose sum is σ = 5140726341120. Its totient is φ = 5001642341280.
The previous prime is 5071183330951. The next prime is 5071183331087. The reversal of 5071183331057 is 7501333811705.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5071183331057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5071183330999 and 5071183331017.
It is not an unprimeable number, because it can be changed into a prime (5071183331087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4950944 + ... + 5886782.
It is an arithmetic number, because the mean of its divisors is an integer number (642590792640).
Almost surely, 25071183331057 is an apocalyptic number.
It is an amenable number.
5071183331057 is a deficient number, since it is larger than the sum of its proper divisors (69543010063).
5071183331057 is an equidigital number, since it uses as much as digits as its factorization.
5071183331057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010143.
The product of its (nonzero) digits is 264600, while the sum is 44.
The spelling of 5071183331057 in words is "five trillion, seventy-one billion, one hundred eighty-three million, three hundred thirty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •