Base | Representation |
---|---|
bin | 1000110110010100010… |
… | …1000010101110111101 |
3 | 112112101111211200121211 |
4 | 2031211011002232331 |
5 | 4442314014113333 |
6 | 153500433124421 |
7 | 13661121632515 |
oct | 2154505025675 |
9 | 475344750554 |
10 | 152019676093 |
11 | 5952016474a |
12 | 255670b9711 |
13 | 11448b2567c |
14 | 7501acc845 |
15 | 3e4b07becd |
hex | 2365142bbd |
152019676093 has 2 divisors, whose sum is σ = 152019676094. Its totient is φ = 152019676092.
The previous prime is 152019676091. The next prime is 152019676097. The reversal of 152019676093 is 390676910251.
152019676093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127382606649 + 24637069444 = 356907^2 + 156962^2 .
It is a cyclic number.
It is not a de Polignac number, because 152019676093 - 21 = 152019676091 is a prime.
Together with 152019676091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152019676091) 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, 76009838046 + 76009838047.
It is an arithmetic number, because the mean of its divisors is an integer number (76009838047).
Almost surely, 2152019676093 is an apocalyptic number.
It is an amenable number.
152019676093 is a deficient number, since it is larger than the sum of its proper divisors (1).
152019676093 is an equidigital number, since it uses as much as digits as its factorization.
152019676093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 612360, while the sum is 49.
The spelling of 152019676093 in words is "one hundred fifty-two billion, nineteen million, six hundred seventy-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •