Base | Representation |
---|---|
bin | 1000101111001010111… |
… | …1000100101111100011 |
3 | 112100102211002211021121 |
4 | 2023302233010233203 |
5 | 4424401414031111 |
6 | 152542224033111 |
7 | 13562436056620 |
oct | 2136257045743 |
9 | 470384084247 |
10 | 150101314531 |
11 | 58726308273 |
12 | 25110762797 |
13 | 1120156339c |
14 | 739d005347 |
15 | 3d87943871 |
hex | 22f2bc4be3 |
150101314531 has 4 divisors (see below), whose sum is σ = 171544359472. Its totient is φ = 128658269592.
The previous prime is 150101314523. The next prime is 150101314549. The reversal of 150101314531 is 135413101051.
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 150101314531 - 23 = 150101314523 is a prime.
It is a super-2 number, since 2×1501013145312 (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 = 150101314496 and 150101314505.
It is not an unprimeable number, because it can be changed into a prime (150101314501) 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, 10721522460 + ... + 10721522473.
It is an arithmetic number, because the mean of its divisors is an integer number (42886089868).
Almost surely, 2150101314531 is an apocalyptic number.
150101314531 is a deficient number, since it is larger than the sum of its proper divisors (21443044941).
150101314531 is an equidigital number, since it uses as much as digits as its factorization.
150101314531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21443044940.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 150101314531 its reverse (135413101051), we get a palindrome (285514415582).
The spelling of 150101314531 in words is "one hundred fifty billion, one hundred one million, three hundred fourteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •