Base | Representation |
---|---|
bin | 100010110111010000001001… |
… | …111111001001100000010111 |
3 | 202002220020211011211110012121 |
4 | 202313100021333021200113 |
5 | 130044131331001004101 |
6 | 1302035020450000411 |
7 | 44203522504614043 |
oct | 4267201177114027 |
9 | 662806734743177 |
10 | 153330500016151 |
11 | 44946110a39857 |
12 | 1524458a276107 |
13 | 677300904c043 |
14 | 29c134305b023 |
15 | 12ad728cc90a1 |
hex | 8b7409fc9817 |
153330500016151 has 2 divisors, whose sum is σ = 153330500016152. Its totient is φ = 153330500016150.
The previous prime is 153330500015999. The next prime is 153330500016173. The reversal of 153330500016151 is 151610005033351.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 153330500016151 - 211 = 153330500014103 is a prime.
It is a super-2 number, since 2×1533305000161512 (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 (153330540016151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76665250008075 + 76665250008076.
It is an arithmetic number, because the mean of its divisors is an integer number (76665250008076).
Almost surely, 2153330500016151 is an apocalyptic number.
153330500016151 is a deficient number, since it is larger than the sum of its proper divisors (1).
153330500016151 is an equidigital number, since it uses as much as digits as its factorization.
153330500016151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20250, while the sum is 34.
The spelling of 153330500016151 in words is "one hundred fifty-three trillion, three hundred thirty billion, five hundred million, sixteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •