Base | Representation |
---|---|
bin | 11110100001001010010… |
… | …10100111110111101011 |
3 | 10201020121102112202022022 |
4 | 33100211022213313223 |
5 | 114140010430440323 |
6 | 2121415042015055 |
7 | 135521114133155 |
oct | 17204512476753 |
9 | 3636542482268 |
10 | 1048595561963 |
11 | 374785948954 |
12 | 14b28464748b |
13 | 77b61094a31 |
14 | 38a7642bad5 |
15 | 1c422b8b4c8 |
hex | f4252a7deb |
1048595561963 has 2 divisors, whose sum is σ = 1048595561964. Its totient is φ = 1048595561962.
The previous prime is 1048595561903. The next prime is 1048595561989. The reversal of 1048595561963 is 3691655958401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1048595561963 - 26 = 1048595561899 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1048595561896 and 1048595561905.
It is not a weakly prime, because it can be changed into another prime (1048595561903) 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 as a sum of consecutive naturals, namely, 524297780981 + 524297780982.
It is an arithmetic number, because the mean of its divisors is an integer number (524297780982).
Almost surely, 21048595561963 is an apocalyptic number.
1048595561963 is a deficient number, since it is larger than the sum of its proper divisors (1).
1048595561963 is an equidigital number, since it uses as much as digits as its factorization.
1048595561963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992000, while the sum is 62.
The spelling of 1048595561963 in words is "one trillion, forty-eight billion, five hundred ninety-five million, five hundred sixty-one thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •