Base | Representation |
---|---|
bin | 1000110010100001001… |
… | …1101110110101010011 |
3 | 112102202110100200212202 |
4 | 2030220103232311103 |
5 | 4433222012212223 |
6 | 153211332313415 |
7 | 13623631545662 |
oct | 2145023566523 |
9 | 472673320782 |
10 | 151000116563 |
11 | 590476a156a |
12 | 2532177286b |
13 | 1131582a6ca |
14 | 744652cdd9 |
15 | 3ddb7d5428 |
hex | 23284eed53 |
151000116563 has 2 divisors, whose sum is σ = 151000116564. Its totient is φ = 151000116562.
The previous prime is 151000116517. The next prime is 151000116569. The reversal of 151000116563 is 365611000151.
151000116563 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 151000116563 - 28 = 151000116307 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (151000116569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75500058281 + 75500058282.
It is an arithmetic number, because the mean of its divisors is an integer number (75500058282).
Almost surely, 2151000116563 is an apocalyptic number.
151000116563 is a deficient number, since it is larger than the sum of its proper divisors (1).
151000116563 is an equidigital number, since it uses as much as digits as its factorization.
151000116563 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 29.
The spelling of 151000116563 in words is "one hundred fifty-one billion, one hundred sixteen thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •