Base | Representation |
---|---|
bin | 1000101111111111111… |
… | …0101100001101000011 |
3 | 112101000022012122002100 |
4 | 2023333332230031003 |
5 | 4430330304342011 |
6 | 153020242321443 |
7 | 13601104525212 |
oct | 2137776541503 |
9 | 471008178070 |
10 | 150323512131 |
11 | 5882a781651 |
12 | 25173059283 |
13 | 112385c0160 |
14 | 73c0725079 |
15 | 3d9c1d4d56 |
hex | 22fffac343 |
150323512131 has 24 divisors (see below), whose sum is σ = 237669972176. Its totient is φ = 90990267840.
The previous prime is 150323512123. The next prime is 150323512147. The reversal of 150323512131 is 131215323051.
150323512131 is a `hidden beast` number, since 1 + 503 + 2 + 3 + 5 + 121 + 31 = 666.
It is not a de Polignac number, because 150323512131 - 23 = 150323512123 is a prime.
It is a super-2 number, since 2×1503235121312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150323512095 and 150323512104.
It is not an unprimeable number, because it can be changed into a prime (150323512111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10524145 + ... + 10538418.
Almost surely, 2150323512131 is an apocalyptic number.
150323512131 is a deficient number, since it is larger than the sum of its proper divisors (87346460045).
150323512131 is a wasteful number, since it uses less digits than its factorization.
150323512131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21062643 (or 21062640 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 150323512131 its reverse (131215323051), we get a palindrome (281538835182).
The spelling of 150323512131 in words is "one hundred fifty billion, three hundred twenty-three million, five hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •