Base | Representation |
---|---|
bin | 1000110000000110010… |
… | …1101001010101101110 |
3 | 112101002011222211011121 |
4 | 2030001211221111232 |
5 | 4430404212014410 |
6 | 153023045011154 |
7 | 13601553113506 |
oct | 2140145512556 |
9 | 471064884147 |
10 | 150350501230 |
11 | 58843a35996 |
12 | 251800b3aba |
13 | 1124107c837 |
14 | 73c414ca06 |
15 | 3d9e7669da |
hex | 230196956e |
150350501230 has 16 divisors (see below), whose sum is σ = 275737146624. Its totient is φ = 59005479520.
The previous prime is 150350501221. The next prime is 150350501233. The reversal of 150350501230 is 32105053051.
It is a super-2 number, since 2×1503505012302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 150350501195 and 150350501204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150350501233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 141839566 + ... + 141840625.
It is an arithmetic number, because the mean of its divisors is an integer number (17233571664).
Almost surely, 2150350501230 is an apocalyptic number.
150350501230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150350501230 is a deficient number, since it is larger than the sum of its proper divisors (125386645394).
150350501230 is a wasteful number, since it uses less digits than its factorization.
150350501230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283680251.
The product of its (nonzero) digits is 2250, while the sum is 25.
Adding to 150350501230 its reverse (32105053051), we get a palindrome (182455554281).
The spelling of 150350501230 in words is "one hundred fifty billion, three hundred fifty million, five hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •