Base | Representation |
---|---|
bin | 100011011110100101000… |
… | …1000101001111101010101 |
3 | 122021010220000211011020202 |
4 | 1012331022020221331111 |
5 | 1114342103101221312 |
6 | 14212003520510245 |
7 | 1012165416201656 |
oct | 106751210517525 |
9 | 18233800734222 |
10 | 4876031663957 |
11 | 160aa05835883 |
12 | 66901117b385 |
13 | 294a669c397c |
14 | 12c0033ad52d |
15 | 86c8419c9c2 |
hex | 46f4a229f55 |
4876031663957 has 2 divisors, whose sum is σ = 4876031663958. Its totient is φ = 4876031663956.
The previous prime is 4876031663953. The next prime is 4876031664019. The reversal of 4876031663957 is 7593661306784.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4725519478276 + 150512185681 = 2173826^2 + 387959^2 .
It is a cyclic number.
It is not a de Polignac number, because 4876031663957 - 22 = 4876031663953 is a prime.
It is a super-2 number, since 2×48760316639572 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4876031663893 and 4876031663902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4876031663953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2438015831978 + 2438015831979.
It is an arithmetic number, because the mean of its divisors is an integer number (2438015831979).
Almost surely, 24876031663957 is an apocalyptic number.
It is an amenable number.
4876031663957 is a deficient number, since it is larger than the sum of its proper divisors (1).
4876031663957 is an equidigital number, since it uses as much as digits as its factorization.
4876031663957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 137168640, while the sum is 65.
The spelling of 4876031663957 in words is "four trillion, eight hundred seventy-six billion, thirty-one million, six hundred sixty-three thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •