Base | Representation |
---|---|
bin | 1000101111001101100… |
… | …1001010111101001111 |
3 | 112100110120212111010211 |
4 | 2023303121022331033 |
5 | 4424412230200111 |
6 | 152543300343251 |
7 | 13562631631240 |
oct | 2136331127517 |
9 | 470416774124 |
10 | 150112350031 |
11 | 58731565416 |
12 | 251143a4b27 |
13 | 11203928377 |
14 | 73a0678cc7 |
15 | 3d888c3521 |
hex | 22f364af4f |
150112350031 has 4 divisors (see below), whose sum is σ = 171556971472. Its totient is φ = 128667728592.
The previous prime is 150112349993. The next prime is 150112350043. The reversal of 150112350031 is 130053211051.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 150112350031 - 213 = 150112341839 is a prime.
It is a super-2 number, since 2×1501123500312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150112349984 and 150112350011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150112350061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10722310710 + ... + 10722310723.
It is an arithmetic number, because the mean of its divisors is an integer number (42889242868).
Almost surely, 2150112350031 is an apocalyptic number.
150112350031 is a deficient number, since it is larger than the sum of its proper divisors (21444621441).
150112350031 is an equidigital number, since it uses as much as digits as its factorization.
150112350031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21444621440.
The product of its (nonzero) digits is 450, while the sum is 22.
Adding to 150112350031 its reverse (130053211051), we get a palindrome (280165561082).
The spelling of 150112350031 in words is "one hundred fifty billion, one hundred twelve million, three hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •