Base | Representation |
---|---|
bin | 100010100100001000000101… |
… | …100001001001011111000111 |
3 | 201221020121021220201021122201 |
4 | 202210020011201021133013 |
5 | 124411113101223102221 |
6 | 1255151132342135331 |
7 | 44006543166004132 |
oct | 4244100541113707 |
9 | 657217256637581 |
10 | 152016165050311 |
11 | 4448976a132661 |
12 | 15071902121547 |
13 | 66a90a81248c3 |
14 | 297789bb23219 |
15 | 1289451656891 |
hex | 8a42058497c7 |
152016165050311 has 2 divisors, whose sum is σ = 152016165050312. Its totient is φ = 152016165050310.
The previous prime is 152016165050251. The next prime is 152016165050329. The reversal of 152016165050311 is 113050561610251.
It is a strong prime.
It is an emirp because it is prime and its reverse (113050561610251) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 152016165050311 - 221 = 152016162953159 is a prime.
It is a super-2 number, since 2×1520161650503112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152016165050341) 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, 76008082525155 + 76008082525156.
It is an arithmetic number, because the mean of its divisors is an integer number (76008082525156).
Almost surely, 2152016165050311 is an apocalyptic number.
152016165050311 is a deficient number, since it is larger than the sum of its proper divisors (1).
152016165050311 is an equidigital number, since it uses as much as digits as its factorization.
152016165050311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 152016165050311 in words is "one hundred fifty-two trillion, sixteen billion, one hundred sixty-five million, fifty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •