Base | Representation |
---|---|
bin | 11110101101101011011… |
… | …00010110010111001111 |
3 | 10201212221201220021121212 |
4 | 33112311230112113033 |
5 | 114242241203231201 |
6 | 2124445525045035 |
7 | 136146460645535 |
oct | 17266554262717 |
9 | 3655851807555 |
10 | 1055315289551 |
11 | 377613a72726 |
12 | 15063ab5677b |
13 | 786922b92c3 |
14 | 39112a6c155 |
15 | 1c6b7a91abb |
hex | f5b5b165cf |
1055315289551 has 2 divisors, whose sum is σ = 1055315289552. Its totient is φ = 1055315289550.
The previous prime is 1055315289529. The next prime is 1055315289619. The reversal of 1055315289551 is 1559825135501.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1055315289551 is a prime.
It is a super-2 number, since 2×10553152895512 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1055315289551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055315289251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527657644775 + 527657644776.
It is an arithmetic number, because the mean of its divisors is an integer number (527657644776).
Almost surely, 21055315289551 is an apocalyptic number.
1055315289551 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055315289551 is an equidigital number, since it uses as much as digits as its factorization.
1055315289551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350000, while the sum is 50.
The spelling of 1055315289551 in words is "one trillion, fifty-five billion, three hundred fifteen million, two hundred eighty-nine thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •