Base | Representation |
---|---|
bin | 1000110000110111001… |
… | …1110010000011001111 |
3 | 112101121110210112121002 |
4 | 2030031303302003033 |
5 | 4431314204033034 |
6 | 153055251330515 |
7 | 13606622630336 |
oct | 2141563620317 |
9 | 471543715532 |
10 | 150555533519 |
11 | 58939745766 |
12 | 252188b0a3b |
13 | 112746a9511 |
14 | 7403480d1d |
15 | 3db2766e7e |
hex | 230dcf20cf |
150555533519 has 2 divisors, whose sum is σ = 150555533520. Its totient is φ = 150555533518.
The previous prime is 150555533497. The next prime is 150555533521. The reversal of 150555533519 is 915335555051.
150555533519 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 150555533519 - 220 = 150554484943 is a prime.
It is a super-2 number, since 2×1505555335192 (a number of 23 digits) contains 22 as substring.
Together with 150555533521, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150555533599) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75277766759 + 75277766760.
It is an arithmetic number, because the mean of its divisors is an integer number (75277766760).
Almost surely, 2150555533519 is an apocalyptic number.
150555533519 is a deficient number, since it is larger than the sum of its proper divisors (1).
150555533519 is an equidigital number, since it uses as much as digits as its factorization.
150555533519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1265625, while the sum is 47.
The spelling of 150555533519 in words is "one hundred fifty billion, five hundred fifty-five million, five hundred thirty-three thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •