Base | Representation |
---|---|
bin | 1000101101101011010… |
… | …0100010111111010101 |
3 | 112022101212010210212102 |
4 | 2023122310202333111 |
5 | 4423041211032312 |
6 | 152434332331445 |
7 | 13546464551306 |
oct | 2133264427725 |
9 | 468355123772 |
10 | 149700095957 |
11 | 5853a88a875 |
12 | 2501a313b85 |
13 | 111693b6249 |
14 | 7361a047ad |
15 | 3d625ddec2 |
hex | 22dad22fd5 |
149700095957 has 2 divisors, whose sum is σ = 149700095958. Its totient is φ = 149700095956.
The previous prime is 149700095933. The next prime is 149700096041. The reversal of 149700095957 is 759590007941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127105797361 + 22594298596 = 356519^2 + 150314^2 .
It is a cyclic number.
It is not a de Polignac number, because 149700095957 - 226 = 149632987093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149700095927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74850047978 + 74850047979.
It is an arithmetic number, because the mean of its divisors is an integer number (74850047979).
Almost surely, 2149700095957 is an apocalyptic number.
It is an amenable number.
149700095957 is a deficient number, since it is larger than the sum of its proper divisors (1).
149700095957 is an equidigital number, since it uses as much as digits as its factorization.
149700095957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3572100, while the sum is 56.
The spelling of 149700095957 in words is "one hundred forty-nine billion, seven hundred million, ninety-five thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •