Base | Representation |
---|---|
bin | 10010000011001… |
… | …01110110000101 |
3 | 101112220112100121 |
4 | 21001211312011 |
5 | 302230141401 |
6 | 23005141541 |
7 | 3515660461 |
oct | 1101456605 |
9 | 345815317 |
10 | 151412101 |
11 | 78517175 |
12 | 4285a8b1 |
13 | 254a4879 |
14 | 161754a1 |
15 | d45cca1 |
hex | 9065d85 |
151412101 has 2 divisors, whose sum is σ = 151412102. Its totient is φ = 151412100.
The previous prime is 151412099. The next prime is 151412117. The reversal of 151412101 is 101214151.
It is an a-pointer prime, because the next prime (151412117) can be obtained adding 151412101 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92659876 + 58752225 = 9626^2 + 7665^2 .
It is an emirp because it is prime and its reverse (101214151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 151412101 - 21 = 151412099 is a prime.
Together with 151412099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151412201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75706050 + 75706051.
It is an arithmetic number, because the mean of its divisors is an integer number (75706051).
Almost surely, 2151412101 is an apocalyptic number.
It is an amenable number.
151412101 is a deficient number, since it is larger than the sum of its proper divisors (1).
151412101 is an equidigital number, since it uses as much as digits as its factorization.
151412101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40, while the sum is 16.
The square root of 151412101 is about 12304.9624542296. The cubic root of 151412101 is about 532.9913922298.
Adding to 151412101 its reverse (101214151), we get a palindrome (252626252).
The spelling of 151412101 in words is "one hundred fifty-one million, four hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •