Base | Representation |
---|---|
bin | 10110101000010110100… |
… | …011110111001110101011 |
3 | 12111200010112121211121220 |
4 | 112220112203313032223 |
5 | 200434430101124123 |
6 | 3150232404233123 |
7 | 220233142340610 |
oct | 26502643671653 |
9 | 5450115554556 |
10 | 1555156661163 |
11 | 54a5a1435286 |
12 | 21149699b7a3 |
13 | b385c606a11 |
14 | 553acb9c507 |
15 | 2a6be7ddce3 |
hex | 16a168f73ab |
1555156661163 has 8 divisors (see below), whose sum is σ = 2369762531328. Its totient is φ = 888660949224.
The previous prime is 1555156661159. The next prime is 1555156661173. The reversal of 1555156661163 is 3611666515551.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1555156661163 - 22 = 1555156661159 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (1555156661173) 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 7 ways as a sum of consecutive naturals, for example, 37027539531 + ... + 37027539572.
It is an arithmetic number, because the mean of its divisors is an integer number (296220316416).
Almost surely, 21555156661163 is an apocalyptic number.
1555156661163 is a deficient number, since it is larger than the sum of its proper divisors (814605870165).
1555156661163 is an equidigital number, since it uses as much as digits as its factorization.
1555156661163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74055079113.
The product of its digits is 2430000, while the sum is 51.
The spelling of 1555156661163 in words is "one trillion, five hundred fifty-five billion, one hundred fifty-six million, six hundred sixty-one thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •