Base | Representation |
---|---|
bin | 1000110000010110111… |
… | …0011001001000110011 |
3 | 112101021000120210112112 |
4 | 2030011232121020303 |
5 | 4431024443344102 |
6 | 153034004315535 |
7 | 13603355036222 |
oct | 2140556311063 |
9 | 471230523475 |
10 | 150419903027 |
11 | 5887a128549 |
12 | 2519b3a2bab |
13 | 1125256bca4 |
14 | 73cd456cb9 |
15 | 3da58c5252 |
hex | 2305b99233 |
150419903027 has 2 divisors, whose sum is σ = 150419903028. Its totient is φ = 150419903026.
The previous prime is 150419903021. The next prime is 150419903107. The reversal of 150419903027 is 720309914051.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 150419903027 - 220 = 150418854451 is a prime.
It is a super-2 number, since 2×1504199030272 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (150419903021) 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 as a sum of consecutive naturals, namely, 75209951513 + 75209951514.
It is an arithmetic number, because the mean of its divisors is an integer number (75209951514).
Almost surely, 2150419903027 is an apocalyptic number.
150419903027 is a deficient number, since it is larger than the sum of its proper divisors (1).
150419903027 is an equidigital number, since it uses as much as digits as its factorization.
150419903027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 150419903027 in words is "one hundred fifty billion, four hundred nineteen million, nine hundred three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •