Base | Representation |
---|---|
bin | 1000110000101011010… |
… | …1010100111111101110 |
3 | 112101110222212000111022 |
4 | 2030022311110333232 |
5 | 4431213413412100 |
6 | 153050305254142 |
7 | 13605445360403 |
oct | 2141265247756 |
9 | 471428760438 |
10 | 150505607150 |
11 | 589135452a8 |
12 | 25204034352 |
13 | 112672487a2 |
14 | 73da9a62aa |
15 | 3dad1a3e85 |
hex | 230ad54fee |
150505607150 has 48 divisors (see below), whose sum is σ = 292181593824. Its totient is φ = 57570986880.
The previous prime is 150505607143. The next prime is 150505607159. The reversal of 150505607150 is 51706505051.
It is a super-2 number, since 2×1505056071502 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 150505607150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150505607159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5705792 + ... + 5732108.
It is an arithmetic number, because the mean of its divisors is an integer number (6087116538).
Almost surely, 2150505607150 is an apocalyptic number.
150505607150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150505607150 is a deficient number, since it is larger than the sum of its proper divisors (141675986674).
150505607150 is a wasteful number, since it uses less digits than its factorization.
150505607150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31325 (or 31320 counting only the distinct ones).
The product of its (nonzero) digits is 26250, while the sum is 35.
The spelling of 150505607150 in words is "one hundred fifty billion, five hundred five million, six hundred seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •