Base | Representation |
---|---|
bin | 10000110100000100111… |
… | …000111010011010111001 |
3 | 11002110100210001122012022 |
4 | 100310010320322122321 |
5 | 122412304111341331 |
6 | 2242444004524225 |
7 | 146322405626123 |
oct | 20640470723271 |
9 | 4073323048168 |
10 | 1155428230841 |
11 | 406018129235 |
12 | 167b1a6b0675 |
13 | 84c58320ac1 |
14 | 3dcccacc213 |
15 | 200c6b8a67b |
hex | 10d04e3a6b9 |
1155428230841 has 2 divisors, whose sum is σ = 1155428230842. Its totient is φ = 1155428230840.
The previous prime is 1155428230771. The next prime is 1155428230849. The reversal of 1155428230841 is 1480328245511.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 667155705616 + 488272525225 = 816796^2 + 698765^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1155428230841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1155428230792 and 1155428230801.
It is not a weakly prime, because it can be changed into another prime (1155428230849) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 577714115420 + 577714115421.
It is an arithmetic number, because the mean of its divisors is an integer number (577714115421).
Almost surely, 21155428230841 is an apocalyptic number.
It is an amenable number.
1155428230841 is a deficient number, since it is larger than the sum of its proper divisors (1).
1155428230841 is an equidigital number, since it uses as much as digits as its factorization.
1155428230841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 307200, while the sum is 44.
The spelling of 1155428230841 in words is "one trillion, one hundred fifty-five billion, four hundred twenty-eight million, two hundred thirty thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •