Base | Representation |
---|---|
bin | 1000110011000111001… |
… | …0101010001111001011 |
3 | 112110011112201221121001 |
4 | 2030301302222033023 |
5 | 4434033230003042 |
6 | 153235214355431 |
7 | 13630603106626 |
oct | 2146162521713 |
9 | 473145657531 |
10 | 151159219147 |
11 | 59119490702 |
12 | 25366abbb77 |
13 | 1133c795851 |
14 | 745d706dbd |
15 | 3dea761bb7 |
hex | 2331caa3cb |
151159219147 has 2 divisors, whose sum is σ = 151159219148. Its totient is φ = 151159219146.
The previous prime is 151159219121. The next prime is 151159219217. The reversal of 151159219147 is 741912951151.
151159219147 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151159219147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 151159219097 and 151159219106.
It is not a weakly prime, because it can be changed into another prime (151159213147) 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, 75579609573 + 75579609574.
It is an arithmetic number, because the mean of its divisors is an integer number (75579609574).
Almost surely, 2151159219147 is an apocalyptic number.
151159219147 is a deficient number, since it is larger than the sum of its proper divisors (1).
151159219147 is an equidigital number, since it uses as much as digits as its factorization.
151159219147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 113400, while the sum is 46.
The spelling of 151159219147 in words is "one hundred fifty-one billion, one hundred fifty-nine million, two hundred nineteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •