Base | Representation |
---|---|
bin | 1000110001111110101… |
… | …1011100001101110111 |
3 | 112102101100221010102011 |
4 | 2030133223130031313 |
5 | 4432422431234243 |
6 | 153145121225051 |
7 | 13620223130422 |
oct | 2143753341567 |
9 | 472340833364 |
10 | 150855336823 |
11 | 58a829a5394 |
12 | 252a1192187 |
13 | 112c1838919 |
14 | 74312029b9 |
15 | 3dcdc3789d |
hex | 231fadc377 |
150855336823 has 2 divisors, whose sum is σ = 150855336824. Its totient is φ = 150855336822.
The previous prime is 150855336791. The next prime is 150855336839. The reversal of 150855336823 is 328633558051.
It is a strong prime.
It is an emirp because it is prime and its reverse (328633558051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150855336823 - 25 = 150855336791 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150855336523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75427668411 + 75427668412.
It is an arithmetic number, because the mean of its divisors is an integer number (75427668412).
Almost surely, 2150855336823 is an apocalyptic number.
150855336823 is a deficient number, since it is larger than the sum of its proper divisors (1).
150855336823 is an equidigital number, since it uses as much as digits as its factorization.
150855336823 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592000, while the sum is 49.
The spelling of 150855336823 in words is "one hundred fifty billion, eight hundred fifty-five million, three hundred thirty-six thousand, eight hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •