Base | Representation |
---|---|
bin | 10000110100101011101… |
… | …001000101001011101001 |
3 | 11002112001002110020200202 |
4 | 100310223221011023221 |
5 | 122420122032021131 |
6 | 2243032312041545 |
7 | 146344462123616 |
oct | 20645351051351 |
9 | 4075032406622 |
10 | 1156078392041 |
11 | 406321127a41 |
12 | 1680803932b5 |
13 | 8502cc30281 |
14 | 3dd511b150d |
15 | 20113cb5bcb |
hex | 10d2ba452e9 |
1156078392041 has 2 divisors, whose sum is σ = 1156078392042. Its totient is φ = 1156078392040.
The previous prime is 1156078392023. The next prime is 1156078392101. The reversal of 1156078392041 is 1402938706511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 688227864025 + 467850528016 = 829595^2 + 683996^2 .
It is a cyclic number.
It is not a de Polignac number, because 1156078392041 - 214 = 1156078375657 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1156078392241) 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, 578039196020 + 578039196021.
It is an arithmetic number, because the mean of its divisors is an integer number (578039196021).
It is a 1-persistent number, because it is pandigital, but 2⋅1156078392041 = 2312156784082 is not.
Almost surely, 21156078392041 is an apocalyptic number.
It is an amenable number.
1156078392041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1156078392041 is an equidigital number, since it uses as much as digits as its factorization.
1156078392041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 47.
The spelling of 1156078392041 in words is "one trillion, one hundred fifty-six billion, seventy-eight million, three hundred ninety-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •