Base | Representation |
---|---|
bin | 10000110100111100101… |
… | …000010000001001100001 |
3 | 11002112202221201111221201 |
4 | 100310330220100021201 |
5 | 122421213011344424 |
6 | 2243120452321201 |
7 | 146354522421262 |
oct | 20647450201141 |
9 | 4075687644851 |
10 | 1156363387489 |
11 | 406457a93272 |
12 | 16813b913201 |
13 | 85076ca662b |
14 | 3dd7ad9a969 |
15 | 2012dd0dd44 |
hex | 10d3ca10261 |
1156363387489 has 2 divisors, whose sum is σ = 1156363387490. Its totient is φ = 1156363387488.
The previous prime is 1156363387471. The next prime is 1156363387547. The reversal of 1156363387489 is 9847833636511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1044927595089 + 111435792400 = 1022217^2 + 333820^2 .
It is a cyclic number.
It is not a de Polignac number, because 1156363387489 - 227 = 1156229169761 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1156363387489.
It is not a weakly prime, because it can be changed into another prime (1156363387409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 578181693744 + 578181693745.
It is an arithmetic number, because the mean of its divisors is an integer number (578181693745).
Almost surely, 21156363387489 is an apocalyptic number.
It is an amenable number.
1156363387489 is a deficient number, since it is larger than the sum of its proper divisors (1).
1156363387489 is an equidigital number, since it uses as much as digits as its factorization.
1156363387489 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 78382080, while the sum is 64.
The spelling of 1156363387489 in words is "one trillion, one hundred fifty-six billion, three hundred sixty-three million, three hundred eighty-seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •