Base | Representation |
---|---|
bin | 10010000011110… |
… | …11010101011001 |
3 | 101120002000002121 |
4 | 21001323111121 |
5 | 302241000441 |
6 | 23011101241 |
7 | 3516505213 |
oct | 1101732531 |
9 | 346060077 |
10 | 151500121 |
11 | 78577313 |
12 | 428a1821 |
13 | 25505956 |
14 | 161995b3 |
15 | d478dd1 |
hex | 907b559 |
151500121 has 2 divisors, whose sum is σ = 151500122. Its totient is φ = 151500120.
The previous prime is 151500119. The next prime is 151500127. The reversal of 151500121 is 121005151.
151500121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145443600 + 6056521 = 12060^2 + 2461^2 .
It is a cyclic number.
It is not a de Polignac number, because 151500121 - 21 = 151500119 is a prime.
Together with 151500119, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 151500095 and 151500104.
It is not a weakly prime, because it can be changed into another prime (151500127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75750060 + 75750061.
It is an arithmetic number, because the mean of its divisors is an integer number (75750061).
Almost surely, 2151500121 is an apocalyptic number.
It is an amenable number.
151500121 is a deficient number, since it is larger than the sum of its proper divisors (1).
151500121 is an equidigital number, since it uses as much as digits as its factorization.
151500121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50, while the sum is 16.
The square root of 151500121 is about 12308.5385403792. The cubic root of 151500121 is about 533.0946530528.
Adding to 151500121 its reverse (121005151), we get a palindrome (272505272).
The spelling of 151500121 in words is "one hundred fifty-one million, five hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •