Base | Representation |
---|---|
bin | 1000110111010011101… |
… | …0011011100001000101 |
3 | 112120002000201021120001 |
4 | 2031310322123201011 |
5 | 4443340021020402 |
6 | 153543043041301 |
7 | 14000525641261 |
oct | 2156472334105 |
9 | 476060637501 |
10 | 152285329477 |
11 | 59647109aa6 |
12 | 25620070231 |
13 | 1148bb88c18 |
14 | 75290c10a1 |
15 | 3e64554187 |
hex | 2374e9b845 |
152285329477 has 2 divisors, whose sum is σ = 152285329478. Its totient is φ = 152285329476.
The previous prime is 152285329447. The next prime is 152285329499. The reversal of 152285329477 is 774923582251.
It is a happy number.
152285329477 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 can be written as a sum of positive squares in only one way, i.e., 141025785156 + 11259544321 = 375534^2 + 106111^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152285329477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152285329447) 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, 76142664738 + 76142664739.
It is an arithmetic number, because the mean of its divisors is an integer number (76142664739).
Almost surely, 2152285329477 is an apocalyptic number.
It is an amenable number.
152285329477 is a deficient number, since it is larger than the sum of its proper divisors (1).
152285329477 is an equidigital number, since it uses as much as digits as its factorization.
152285329477 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8467200, while the sum is 55.
The spelling of 152285329477 in words is "one hundred fifty-two billion, two hundred eighty-five million, three hundred twenty-nine thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •