Base | Representation |
---|---|
bin | 10111011011010100001111… |
… | …101001111101010101111111 |
3 | 111111210210012110220000102201 |
4 | 113123110033221331111333 |
5 | 102001040003134334101 |
6 | 1003044204321532331 |
7 | 30462555533332435 |
oct | 2733241751752577 |
9 | 444723173800381 |
10 | 103032233121151 |
11 | 2a9137a7608954 |
12 | b6804064a40a7 |
13 | 4564b898980a9 |
14 | 1b62b02972d55 |
15 | bda188bece01 |
hex | 5db50fa7d57f |
103032233121151 has 2 divisors, whose sum is σ = 103032233121152. Its totient is φ = 103032233121150.
The previous prime is 103032233121107. The next prime is 103032233121193. The reversal of 103032233121151 is 151121332230301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103032233121151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103032233121101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51516116560575 + 51516116560576.
It is an arithmetic number, because the mean of its divisors is an integer number (51516116560576).
Almost surely, 2103032233121151 is an apocalyptic number.
103032233121151 is a deficient number, since it is larger than the sum of its proper divisors (1).
103032233121151 is an equidigital number, since it uses as much as digits as its factorization.
103032233121151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 103032233121151 its reverse (151121332230301), we get a palindrome (254153565351452).
The spelling of 103032233121151 in words is "one hundred three trillion, thirty-two billion, two hundred thirty-three million, one hundred twenty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •