Base | Representation |
---|---|
bin | 1000110111011010110… |
… | …0000000110010001101 |
3 | 112120011002202000001212 |
4 | 2031312230000302031 |
5 | 4443420131320042 |
6 | 153550025144205 |
7 | 14001340011521 |
oct | 2156654006215 |
9 | 476132660055 |
10 | 152315104397 |
11 | 596619a6375 |
12 | 2562a02b065 |
13 | 114950b2611 |
14 | 752d031d81 |
15 | 3e66e86482 |
hex | 2376b00c8d |
152315104397 has 2 divisors, whose sum is σ = 152315104398. Its totient is φ = 152315104396.
The previous prime is 152315104387. The next prime is 152315104399. The reversal of 152315104397 is 793401513251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128551648681 + 23763455716 = 358541^2 + 154154^2 .
It is an emirp because it is prime and its reverse (793401513251) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 152315104397 - 216 = 152315038861 is a prime.
Together with 152315104399, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152315104399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76157552198 + 76157552199.
It is an arithmetic number, because the mean of its divisors is an integer number (76157552199).
Almost surely, 2152315104397 is an apocalyptic number.
It is an amenable number.
152315104397 is a deficient number, since it is larger than the sum of its proper divisors (1).
152315104397 is an equidigital number, since it uses as much as digits as its factorization.
152315104397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 41.
The spelling of 152315104397 in words is "one hundred fifty-two billion, three hundred fifteen million, one hundred four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •