Base | Representation |
---|---|
bin | 1001000010001100110… |
… | …0100000101101110111 |
3 | 112211121210200121211222 |
4 | 2100203030200231313 |
5 | 10020332040224301 |
6 | 155145134020555 |
7 | 14133142216151 |
oct | 2204314405567 |
9 | 484553617758 |
10 | 155209304951 |
11 | 5a907674058 |
12 | 260b734775b |
13 | 118368a271c |
14 | 7725577ad1 |
15 | 40860cc31b |
hex | 2423320b77 |
155209304951 has 2 divisors, whose sum is σ = 155209304952. Its totient is φ = 155209304950.
The previous prime is 155209304933. The next prime is 155209304959. The reversal of 155209304951 is 159403902551.
It is a strong prime.
It is an emirp because it is prime and its reverse (159403902551) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-155209304951 is a prime.
It is a super-2 number, since 2×1552093049512 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155209304959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77604652475 + 77604652476.
It is an arithmetic number, because the mean of its divisors is an integer number (77604652476).
Almost surely, 2155209304951 is an apocalyptic number.
155209304951 is a deficient number, since it is larger than the sum of its proper divisors (1).
155209304951 is an equidigital number, since it uses as much as digits as its factorization.
155209304951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243000, while the sum is 44.
The spelling of 155209304951 in words is "one hundred fifty-five billion, two hundred nine million, three hundred four thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •