Base | Representation |
---|---|
bin | 10000110101001010111… |
… | …100010010111111101011 |
3 | 11002120101200120200000102 |
4 | 100311022330102333223 |
5 | 122422211000214201 |
6 | 2243200351300015 |
7 | 146363466510044 |
oct | 20651274227753 |
9 | 4076350520012 |
10 | 1156603523051 |
11 | 406570599709 |
12 | 1681a821a60b |
13 | 850b4974092 |
14 | 3dda0c298cb |
15 | 20144e4526b |
hex | 10d4af12feb |
1156603523051 has 2 divisors, whose sum is σ = 1156603523052. Its totient is φ = 1156603523050.
The previous prime is 1156603523029. The next prime is 1156603523083. The reversal of 1156603523051 is 1503253066511.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1156603523051 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1156603522996 and 1156603523014.
It is not a weakly prime, because it can be changed into another prime (1156603522051) 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, 578301761525 + 578301761526.
It is an arithmetic number, because the mean of its divisors is an integer number (578301761526).
Almost surely, 21156603523051 is an apocalyptic number.
1156603523051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1156603523051 is an equidigital number, since it uses as much as digits as its factorization.
1156603523051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 38.
Adding to 1156603523051 its reverse (1503253066511), we get a palindrome (2659856589562).
The spelling of 1156603523051 in words is "one trillion, one hundred fifty-six billion, six hundred three million, five hundred twenty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •