Base | Representation |
---|---|
bin | 110011011000001011… |
… | …1000100101101000101 |
3 | 101112210022001012022002 |
4 | 1212300113010231011 |
5 | 3301430223132442 |
6 | 122404123315045 |
7 | 10654104130103 |
oct | 1466027045505 |
9 | 345708035262 |
10 | 110333020997 |
11 | 42879128781 |
12 | 1947237ba85 |
13 | a5344b9a54 |
14 | 54a9510c73 |
15 | 2d0b47a732 |
hex | 19b05c4b45 |
110333020997 has 2 divisors, whose sum is σ = 110333020998. Its totient is φ = 110333020996.
The previous prime is 110333020961. The next prime is 110333021069. The reversal of 110333020997 is 799020333011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73289859841 + 37043161156 = 270721^2 + 192466^2 .
It is an emirp because it is prime and its reverse (799020333011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110333020997 - 222 = 110328826693 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110333020997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110333020907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55166510498 + 55166510499.
It is an arithmetic number, because the mean of its divisors is an integer number (55166510499).
Almost surely, 2110333020997 is an apocalyptic number.
It is an amenable number.
110333020997 is a deficient number, since it is larger than the sum of its proper divisors (1).
110333020997 is an equidigital number, since it uses as much as digits as its factorization.
110333020997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618, while the sum is 38.
The spelling of 110333020997 in words is "one hundred ten billion, three hundred thirty-three million, twenty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •