Base | Representation |
---|---|
bin | 1111010011001110… |
… | …10001110011010101 |
3 | 210012110202110220012 |
4 | 13221213101303111 |
5 | 113310333331112 |
6 | 3435034050005 |
7 | 410362603211 |
oct | 75147216325 |
9 | 23173673805 |
10 | 8214355157 |
11 | 3535875678 |
12 | 1712b79905 |
13 | a0ba853a8 |
14 | 57cd45941 |
15 | 33123d022 |
hex | 1e99d1cd5 |
8214355157 has 2 divisors, whose sum is σ = 8214355158. Its totient is φ = 8214355156.
The previous prime is 8214355129. The next prime is 8214355199. The reversal of 8214355157 is 7515534128.
It is a happy number.
8214355157 is digitally balanced in base 3, 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., 8213978161 + 376996 = 90631^2 + 614^2 .
It is a cyclic number.
It is not a de Polignac number, because 8214355157 - 214 = 8214338773 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8214358157) 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, 4107177578 + 4107177579.
It is an arithmetic number, because the mean of its divisors is an integer number (4107177579).
Almost surely, 28214355157 is an apocalyptic number.
It is an amenable number.
8214355157 is a deficient number, since it is larger than the sum of its proper divisors (1).
8214355157 is an equidigital number, since it uses as much as digits as its factorization.
8214355157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 168000, while the sum is 41.
The square root of 8214355157 is about 90633.0798163673. The cubic root of 8214355157 is about 2017.7057209223.
The spelling of 8214355157 in words is "eight billion, two hundred fourteen million, three hundred fifty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •