Base | Representation |
---|---|
bin | 11001000101100000110100… |
… | …100101000100101001011001 |
3 | 112110122110000112121000022112 |
4 | 121011200310211010221121 |
5 | 103430121321010030431 |
6 | 1030352523032402105 |
7 | 32145036205516664 |
oct | 3105406445045131 |
9 | 473573015530275 |
10 | 110330002033241 |
11 | 3217776693a091 |
12 | 1045a83a546335 |
13 | 49740c7a27753 |
14 | 1d3600189a6db |
15 | cb4e0ac9cc2b |
hex | 645834944a59 |
110330002033241 has 2 divisors, whose sum is σ = 110330002033242. Its totient is φ = 110330002033240.
The previous prime is 110330002033213. The next prime is 110330002033259. The reversal of 110330002033241 is 142330200033011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60273811031641 + 50056191001600 = 7763621^2 + 7075040^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110330002033241 is a prime.
It is not a weakly prime, because it can be changed into another prime (110330002039241) 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, 55165001016620 + 55165001016621.
It is an arithmetic number, because the mean of its divisors is an integer number (55165001016621).
Almost surely, 2110330002033241 is an apocalyptic number.
It is an amenable number.
110330002033241 is a deficient number, since it is larger than the sum of its proper divisors (1).
110330002033241 is an equidigital number, since it uses as much as digits as its factorization.
110330002033241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 110330002033241 its reverse (142330200033011), we get a palindrome (252660202066252).
The spelling of 110330002033241 in words is "one hundred ten trillion, three hundred thirty billion, two million, thirty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •