Base | Representation |
---|---|
bin | 100010010111100001111011… |
… | …110011010100000100011101 |
3 | 201211011212000211122010002001 |
4 | 202113201323303110010131 |
5 | 124302422324412124244 |
6 | 1253245340025202301 |
7 | 43560160635405331 |
oct | 4227417363240435 |
9 | 654155024563061 |
10 | 151150566129949 |
11 | 441856601030a1 |
12 | 14b51baa930391 |
13 | 664558b781129 |
14 | 2947a254a17c1 |
15 | 1271b8e3025d4 |
hex | 89787bcd411d |
151150566129949 has 2 divisors, whose sum is σ = 151150566129950. Its totient is φ = 151150566129948.
The previous prime is 151150566129923. The next prime is 151150566130007. The reversal of 151150566129949 is 949921665051151.
151150566129949 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., 88219187745049 + 62931378384900 = 9392507^2 + 7932930^2 .
It is a cyclic number.
It is not a de Polignac number, because 151150566129949 - 217 = 151150565998877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151150566129749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75575283064974 + 75575283064975.
It is an arithmetic number, because the mean of its divisors is an integer number (75575283064975).
Almost surely, 2151150566129949 is an apocalyptic number.
It is an amenable number.
151150566129949 is a deficient number, since it is larger than the sum of its proper divisors (1).
151150566129949 is an equidigital number, since it uses as much as digits as its factorization.
151150566129949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26244000, while the sum is 64.
The spelling of 151150566129949 in words is "one hundred fifty-one trillion, one hundred fifty billion, five hundred sixty-six million, one hundred twenty-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •