Base | Representation |
---|---|
bin | 1000110110110111001… |
… | …0001000010110100001 |
3 | 112112202200122011000202 |
4 | 2031231302020112201 |
5 | 4443113410311223 |
6 | 153523131154545 |
7 | 13664544136145 |
oct | 2155562102641 |
9 | 475680564022 |
10 | 152165713313 |
11 | 5959563a669 |
12 | 255a7ba5a55 |
13 | 11470167923 |
14 | 7517265225 |
15 | 3e58cc7428 |
hex | 236dc885a1 |
152165713313 has 2 divisors, whose sum is σ = 152165713314. Its totient is φ = 152165713312.
The previous prime is 152165713289. The next prime is 152165713367. The reversal of 152165713313 is 313317561251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 144777967009 + 7387746304 = 380497^2 + 85952^2 .
It is a cyclic number.
It is not a de Polignac number, because 152165713313 - 210 = 152165712289 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 (152165713373) 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, 76082856656 + 76082856657.
It is an arithmetic number, because the mean of its divisors is an integer number (76082856657).
Almost surely, 2152165713313 is an apocalyptic number.
It is an amenable number.
152165713313 is a deficient number, since it is larger than the sum of its proper divisors (1).
152165713313 is an equidigital number, since it uses as much as digits as its factorization.
152165713313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 56700, while the sum is 38.
The spelling of 152165713313 in words is "one hundred fifty-two billion, one hundred sixty-five million, seven hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •