Base | Representation |
---|---|
bin | 1000110000001001110… |
… | …1000000000000111111 |
3 | 112101010012022001020200 |
4 | 2030002131000000333 |
5 | 4430421420341111 |
6 | 153024324014543 |
7 | 13602120341163 |
oct | 2140235000077 |
9 | 471105261220 |
10 | 150365012031 |
11 | 58851147093 |
12 | 25184b31453 |
13 | 11244090600 |
14 | 73c6048ca3 |
15 | 3da0b81256 |
hex | 230274003f |
150365012031 has 36 divisors (see below), whose sum is σ = 235431816048. Its totient is φ = 92435720832.
The previous prime is 150365012023. The next prime is 150365012051. The reversal of 150365012031 is 130210563051.
150365012031 is a `hidden beast` number, since 1 + 5 + 0 + 3 + 650 + 1 + 2 + 0 + 3 + 1 = 666.
It is not a de Polignac number, because 150365012031 - 23 = 150365012023 is a prime.
It is a super-2 number, since 2×1503650120312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150365011986 and 150365012004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150365012051) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1419691 + ... + 1521923.
It is an arithmetic number, because the mean of its divisors is an integer number (6539772668).
Almost surely, 2150365012031 is an apocalyptic number.
150365012031 is a deficient number, since it is larger than the sum of its proper divisors (85066804017).
150365012031 is a wasteful number, since it uses less digits than its factorization.
150365012031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103232 (or 103216 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 150365012031 its reverse (130210563051), we get a palindrome (280575575082).
The spelling of 150365012031 in words is "one hundred fifty billion, three hundred sixty-five million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •