Base | Representation |
---|---|
bin | 1000110000110001001… |
… | …1010101101000101111 |
3 | 112101112201020001221000 |
4 | 2030030103111220233 |
5 | 4431241221020221 |
6 | 153052545411343 |
7 | 13606165011306 |
oct | 2141423255057 |
9 | 471481201830 |
10 | 150530251311 |
11 | 58926447880 |
12 | 25210339b53 |
13 | 1126c396a2b |
14 | 73ddd7d43d |
15 | 3db0420e26 |
hex | 230c4d5a2f |
150530251311 has 16 divisors (see below), whose sum is σ = 243281214720. Its totient is φ = 91230455160.
The previous prime is 150530251279. The next prime is 150530251337. The reversal of 150530251311 is 113152035051.
150530251311 is a `hidden beast` number, since 1 + 50 + 53 + 0 + 251 + 311 = 666.
It is not a de Polignac number, because 150530251311 - 25 = 150530251279 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150530259311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 253417635 + ... + 253418228.
It is an arithmetic number, because the mean of its divisors is an integer number (15205075920).
Almost surely, 2150530251311 is an apocalyptic number.
150530251311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
150530251311 is a deficient number, since it is larger than the sum of its proper divisors (92750963409).
150530251311 is a wasteful number, since it uses less digits than its factorization.
150530251311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 506835883 (or 506835877 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
Adding to 150530251311 its reverse (113152035051), we get a palindrome (263682286362).
The spelling of 150530251311 in words is "one hundred fifty billion, five hundred thirty million, two hundred fifty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •