Base | Representation |
---|---|
bin | 1000101111010100001… |
… | …1010010100010011111 |
3 | 112100112112012210200222 |
4 | 2023311003102202133 |
5 | 4424441340341401 |
6 | 152550132511555 |
7 | 13563420242225 |
oct | 2136503224237 |
9 | 470475183628 |
10 | 150140168351 |
11 | 58746235768 |
12 | 2512177b5bb |
13 | 11209618304 |
14 | 73a423ab15 |
15 | 3d8b06ac1b |
hex | 22f50d289f |
150140168351 has 2 divisors, whose sum is σ = 150140168352. Its totient is φ = 150140168350.
The previous prime is 150140168329. The next prime is 150140168357. The reversal of 150140168351 is 153861041051.
150140168351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 150140168351 - 230 = 149066426527 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (150140168357) 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, 75070084175 + 75070084176.
It is an arithmetic number, because the mean of its divisors is an integer number (75070084176).
Almost surely, 2150140168351 is an apocalyptic number.
150140168351 is a deficient number, since it is larger than the sum of its proper divisors (1).
150140168351 is an equidigital number, since it uses as much as digits as its factorization.
150140168351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 35.
The spelling of 150140168351 in words is "one hundred fifty billion, one hundred forty million, one hundred sixty-eight thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •