Base | Representation |
---|---|
bin | 11001000100000101101111… |
… | …001100000111101011100101 |
3 | 112110022002120121212211120000 |
4 | 121010011233030013223211 |
5 | 103422021021440200010 |
6 | 1030235550223131513 |
7 | 32135004463352565 |
oct | 3104055714075345 |
9 | 473262517784500 |
10 | 110232201100005 |
11 | 3213a239856436 |
12 | 104438a5143b99 |
13 | 4967b0c9b095a |
14 | 1d313a4912da5 |
15 | cb25d4b487c0 |
hex | 64416f307ae5 |
110232201100005 has 40 divisors (see below), whose sum is σ = 197761949113344. Its totient is φ = 58742748655200.
The previous prime is 110232201099991. The next prime is 110232201100051. The reversal of 110232201100005 is 500001102232011.
It is not a de Polignac number, because 110232201100005 - 24 = 110232201099989 is a prime.
It is a super-2 number, since 2×1102322011000052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 110053141 + ... + 111050250.
Almost surely, 2110232201100005 is an apocalyptic number.
110232201100005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
110232201100005 is a deficient number, since it is larger than the sum of its proper divisors (87529748013339).
110232201100005 is a wasteful number, since it uses less digits than its factorization.
110232201100005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221104639 (or 221104630 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 110232201100005 its reverse (500001102232011), we get a palindrome (610233303332016).
The spelling of 110232201100005 in words is "one hundred ten trillion, two hundred thirty-two billion, two hundred one million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •