Base | Representation |
---|---|
bin | 10110101000010110100… |
… | …011011111100010110111 |
3 | 12111200010112102220112212 |
4 | 112220112203133202313 |
5 | 200434430040023101 |
6 | 3150232402204035 |
7 | 220233141455021 |
oct | 26502643374267 |
9 | 5450115386485 |
10 | 1555156564151 |
11 | 54a5a1379403 |
12 | 21149695361b |
13 | b385c5a1808 |
14 | 553acb75011 |
15 | 2a6be7c01bb |
hex | 16a168df8b7 |
1555156564151 has 4 divisors (see below), whose sum is σ = 1608782652600. Its totient is φ = 1501530475704.
The previous prime is 1555156564133. The next prime is 1555156564183. The reversal of 1555156564151 is 1514656515551.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1555156564151 - 214 = 1555156547767 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1555156564151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1555156564651) 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 in 3 ways as a sum of consecutive naturals, for example, 26813044181 + ... + 26813044238.
It is an arithmetic number, because the mean of its divisors is an integer number (402195663150).
Almost surely, 21555156564151 is an apocalyptic number.
1555156564151 is a deficient number, since it is larger than the sum of its proper divisors (53626088449).
1555156564151 is an equidigital number, since it uses as much as digits as its factorization.
1555156564151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53626088448.
The product of its digits is 2250000, while the sum is 50.
The spelling of 1555156564151 in words is "one trillion, five hundred fifty-five billion, one hundred fifty-six million, five hundred sixty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •