Base | Representation |
---|---|
bin | 100100010101111100001… |
… | …1110000101100011000111 |
3 | 122200111202121101121221112 |
4 | 1020223320132011203013 |
5 | 1123314044140301232 |
6 | 14342345044035235 |
7 | 1023604534603433 |
oct | 110537036054307 |
9 | 18614677347845 |
10 | 4994920634567 |
11 | 1656374532096 |
12 | 688070992b1b |
13 | 2a30329680a6 |
14 | 133a80d459c3 |
15 | 89de183e4b2 |
hex | 48af87858c7 |
4994920634567 has 2 divisors, whose sum is σ = 4994920634568. Its totient is φ = 4994920634566.
The previous prime is 4994920634479. The next prime is 4994920634581. The reversal of 4994920634567 is 7654360294994.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4994920634567 - 212 = 4994920630471 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4994920634497 and 4994920634506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4994920634597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2497460317283 + 2497460317284.
It is an arithmetic number, because the mean of its divisors is an integer number (2497460317284).
Almost surely, 24994920634567 is an apocalyptic number.
4994920634567 is a deficient number, since it is larger than the sum of its proper divisors (1).
4994920634567 is an equidigital number, since it uses as much as digits as its factorization.
4994920634567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 352719360, while the sum is 68.
The spelling of 4994920634567 in words is "four trillion, nine hundred ninety-four billion, nine hundred twenty million, six hundred thirty-four thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •