Base | Representation |
---|---|
bin | 100011101100110100010… |
… | …1100111110011101011011 |
3 | 122101001211000222121211001 |
4 | 1013121220230332131123 |
5 | 1120342213433211132 |
6 | 14234022025045431 |
7 | 1014330231451144 |
oct | 107315054763533 |
9 | 18331730877731 |
10 | 4906609272667 |
11 | 1621977023883 |
12 | 672b25626877 |
13 | 2978ca94496b |
14 | 12d6a4412acb |
15 | 8797386ece7 |
hex | 47668b3e75b |
4906609272667 has 2 divisors, whose sum is σ = 4906609272668. Its totient is φ = 4906609272666.
The previous prime is 4906609272647. The next prime is 4906609272703. The reversal of 4906609272667 is 7662729066094.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4906609272667 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4906609272599 and 4906609272608.
It is not a weakly prime, because it can be changed into another prime (4906609272647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2453304636333 + 2453304636334.
It is an arithmetic number, because the mean of its divisors is an integer number (2453304636334).
Almost surely, 24906609272667 is an apocalyptic number.
4906609272667 is a deficient number, since it is larger than the sum of its proper divisors (1).
4906609272667 is an equidigital number, since it uses as much as digits as its factorization.
4906609272667 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82301184, while the sum is 64.
The spelling of 4906609272667 in words is "four trillion, nine hundred six billion, six hundred nine million, two hundred seventy-two thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •