Base | Representation |
---|---|
bin | 11001000011101011101010… |
… | …111110110000100001110011 |
3 | 112110012102100002201020212101 |
4 | 121003223222332300201303 |
5 | 103421041212034413021 |
6 | 1030215041105241231 |
7 | 32132664065215456 |
oct | 3103535276604163 |
9 | 473172302636771 |
10 | 110204213201011 |
11 | 321293873746a6 |
12 | 1043a394033217 |
13 | 496529c43bb87 |
14 | 1d2dcab7d349d |
15 | cb19e79c2a91 |
hex | 643aeafb0873 |
110204213201011 has 8 divisors (see below), whose sum is σ = 110316593749824. Its totient is φ = 110091836351040.
The previous prime is 110204213200967. The next prime is 110204213201051. The reversal of 110204213201011 is 110102312402011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110204213201011 - 231 = 110202065717363 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110204213201011.
It is not an unprimeable number, because it can be changed into a prime (110204213201051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60792111 + ... + 62578663.
It is an arithmetic number, because the mean of its divisors is an integer number (13789574218728).
Almost surely, 2110204213201011 is an apocalyptic number.
110204213201011 is a deficient number, since it is larger than the sum of its proper divisors (112380548813).
110204213201011 is an equidigital number, since it uses as much as digits as its factorization.
110204213201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1849421.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 110204213201011 its reverse (110102312402011), we get a palindrome (220306525603022).
The spelling of 110204213201011 in words is "one hundred ten trillion, two hundred four billion, two hundred thirteen million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •