Base | Representation |
---|---|
bin | 1000110111010011001… |
… | …0111001100000111001 |
3 | 112120001212222222100102 |
4 | 2031310302321200321 |
5 | 4443334014331233 |
6 | 153542532445145 |
7 | 14000503106324 |
oct | 2156462714071 |
9 | 476055888312 |
10 | 152283355193 |
11 | 59645a90762 |
12 | 2561b4797b5 |
13 | 1148b6473c8 |
14 | 7528b297bb |
15 | 3e642b41e8 |
hex | 2374cb9839 |
152283355193 has 2 divisors, whose sum is σ = 152283355194. Its totient is φ = 152283355192.
The previous prime is 152283355141. The next prime is 152283355201. The reversal of 152283355193 is 391553382251.
152283355193 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., 91278307129 + 61005048064 = 302123^2 + 246992^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152283355193 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (152283354193) 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, 76141677596 + 76141677597.
It is an arithmetic number, because the mean of its divisors is an integer number (76141677597).
Almost surely, 2152283355193 is an apocalyptic number.
It is an amenable number.
152283355193 is a deficient number, since it is larger than the sum of its proper divisors (1).
152283355193 is an equidigital number, since it uses as much as digits as its factorization.
152283355193 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 972000, while the sum is 47.
The spelling of 152283355193 in words is "one hundred fifty-two billion, two hundred eighty-three million, three hundred fifty-five thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •