Base | Representation |
---|---|
bin | 100011010100110011011011… |
… | …101001101010100101011111 |
3 | 202101002101112002110012101112 |
4 | 203110303123221222211133 |
5 | 130330414310443213201 |
6 | 1310231545213532235 |
7 | 44503323261223034 |
oct | 4324633351524537 |
9 | 671071462405345 |
10 | 155361242163551 |
11 | 45559372a3aa26 |
12 | 155120717a407b |
13 | 688c66b653978 |
14 | 2a5174a74138b |
15 | 12e6480b2b0bb |
hex | 8d4cdba6a95f |
155361242163551 has 4 divisors (see below), whose sum is σ = 155425680673704. Its totient is φ = 155296803653400.
The previous prime is 155361242163493. The next prime is 155361242163571.
155361242163551 is nontrivially palindromic in base 10.
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 155361242163551 - 26 = 155361242163487 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 155361242163551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155361242163571) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32219251460 + ... + 32219256281.
It is an arithmetic number, because the mean of its divisors is an integer number (38856420168426).
Almost surely, 2155361242163551 is an apocalyptic number.
155361242163551 is a deficient number, since it is larger than the sum of its proper divisors (64438510153).
155361242163551 is an equidigital number, since it uses as much as digits as its factorization.
155361242163551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64438510152.
The product of its digits is 3240000, while the sum is 50.
The spelling of 155361242163551 in words is "one hundred fifty-five trillion, three hundred sixty-one billion, two hundred forty-two million, one hundred sixty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •