Base | Representation |
---|---|
bin | 11001000000101111011110… |
… | …000100101111010110011011 |
3 | 112102111002201210112200120211 |
4 | 121000233132010233112123 |
5 | 103404233332044433311 |
6 | 1025542140553431551 |
7 | 32112251256450406 |
oct | 3100573604572633 |
9 | 472432653480524 |
10 | 110002133202331 |
11 | 32060708496727 |
12 | 10407197a0b5b7 |
13 | 494c206215a66 |
14 | 1d241bb390d3d |
15 | cab61bb37821 |
hex | 640bde12f59b |
110002133202331 has 4 divisors (see below), whose sum is σ = 110002168199952. Its totient is φ = 110002098204712.
The previous prime is 110002133202263. The next prime is 110002133202527. The reversal of 110002133202331 is 133202331200011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110002133202331 - 211 = 110002133200283 is a prime.
It is a super-2 number, since 2×1100021332023312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110002133802331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12261640 + ... + 19244533.
It is an arithmetic number, because the mean of its divisors is an integer number (27500542049988).
Almost surely, 2110002133202331 is an apocalyptic number.
110002133202331 is a deficient number, since it is larger than the sum of its proper divisors (34997621).
110002133202331 is an equidigital number, since it uses as much as digits as its factorization.
110002133202331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34997620.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 110002133202331 its reverse (133202331200011), we get a palindrome (243204464402342).
The spelling of 110002133202331 in words is "one hundred ten trillion, two billion, one hundred thirty-three million, two hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •