Base | Representation |
---|---|
bin | 1001000001111110111… |
… | …0000110000111000001 |
3 | 112211110201222102111101 |
4 | 2100133232012013001 |
5 | 10020222124000001 |
6 | 155135252214401 |
7 | 14131533511654 |
oct | 2203756060701 |
9 | 484421872441 |
10 | 155151000001 |
11 | 5a887770748 |
12 | 2609b90a401 |
13 | 1182779a15a |
14 | 771b91b89b |
15 | 4080e11a01 |
hex | 241fb861c1 |
155151000001 has 2 divisors, whose sum is σ = 155151000002. Its totient is φ = 155151000000.
The previous prime is 155150999929. The next prime is 155151000023. The reversal of 155151000001 is 100000151551.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153965988225 + 1185011776 = 392385^2 + 34424^2 .
It is an emirp because it is prime and its reverse (100000151551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 155151000001 - 215 = 155150967233 is a prime.
It is not a weakly prime, because it can be changed into another prime (155151000041) 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, 77575500000 + 77575500001.
It is an arithmetic number, because the mean of its divisors is an integer number (77575500001).
Almost surely, 2155151000001 is an apocalyptic number.
It is an amenable number.
155151000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
155151000001 is an equidigital number, since it uses as much as digits as its factorization.
155151000001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 125, while the sum is 19.
Adding to 155151000001 its reverse (100000151551), we get a palindrome (255151151552).
The spelling of 155151000001 in words is "one hundred fifty-five billion, one hundred fifty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •