Base | Representation |
---|---|
bin | 1000110010010000101… |
… | …0100111111100001001 |
3 | 112102120121120220202020 |
4 | 2030210022213330021 |
5 | 4433101214321134 |
6 | 153200410555053 |
7 | 13622126050410 |
oct | 2144412477411 |
9 | 472517526666 |
10 | 150930620169 |
11 | 5901144492a |
12 | 25302438a89 |
13 | 11304307194 |
14 | 743b1dc477 |
15 | 3dd5658b49 |
hex | 23242a7f09 |
150930620169 has 32 divisors (see below), whose sum is σ = 243107328000. Its totient is φ = 81364881024.
The previous prime is 150930620143. The next prime is 150930620179. The reversal of 150930620169 is 961026039051.
It is not a de Polignac number, because 150930620169 - 29 = 150930619657 is a prime.
It is a super-2 number, since 2×1509306201692 (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 150930620169.
It is not an unprimeable number, because it can be changed into a prime (150930620129) 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 31 ways as a sum of consecutive naturals, for example, 696004 + ... + 886725.
It is an arithmetic number, because the mean of its divisors is an integer number (7597104000).
Almost surely, 2150930620169 is an apocalyptic number.
150930620169 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
150930620169 is a deficient number, since it is larger than the sum of its proper divisors (92176707831).
150930620169 is a wasteful number, since it uses less digits than its factorization.
150930620169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582997.
The product of its (nonzero) digits is 87480, while the sum is 42.
The spelling of 150930620169 in words is "one hundred fifty billion, nine hundred thirty million, six hundred twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •