Base | Representation |
---|---|
bin | 10010101110000… |
… | …00101011011001 |
3 | 101221110210121001 |
4 | 21113000223121 |
5 | 310144331113 |
6 | 23325345001 |
7 | 3614464522 |
oct | 1127005331 |
9 | 357423531 |
10 | 157027033 |
11 | 80701809 |
12 | 44708161 |
13 | 266bc507 |
14 | 16bd7849 |
15 | dbbb7dd |
hex | 95c0ad9 |
157027033 has 2 divisors, whose sum is σ = 157027034. Its totient is φ = 157027032.
The previous prime is 157027019. The next prime is 157027051. The reversal of 157027033 is 330720751.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134861769 + 22165264 = 11613^2 + 4708^2 .
It is an emirp because it is prime and its reverse (330720751) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-157027033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 157026992 and 157027010.
It is not a weakly prime, because it can be changed into another prime (157027433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78513516 + 78513517.
It is an arithmetic number, because the mean of its divisors is an integer number (78513517).
Almost surely, 2157027033 is an apocalyptic number.
It is an amenable number.
157027033 is a deficient number, since it is larger than the sum of its proper divisors (1).
157027033 is an equidigital number, since it uses as much as digits as its factorization.
157027033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4410, while the sum is 28.
The square root of 157027033 is about 12531.0427738477. The cubic root of 157027033 is about 539.5000322098.
Adding to 157027033 its reverse (330720751), we get a palindrome (487747784).
The spelling of 157027033 in words is "one hundred fifty-seven million, twenty-seven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •