Base | Representation |
---|---|
bin | 11001000010101000011100… |
… | …000011111101011001101011 |
3 | 112102221111222222121122010202 |
4 | 121002220130003331121223 |
5 | 103413400340141012021 |
6 | 1030121541425502415 |
7 | 32124530114654453 |
oct | 3102503403753153 |
9 | 472844888548122 |
10 | 110132022204011 |
11 | 32100801442105 |
12 | 104283a74a1a0b |
13 | 495b5360c59c2 |
14 | 1d2a5bdc04d63 |
15 | caebbed72a0b |
hex | 642a1c0fd66b |
110132022204011 has 8 divisors (see below), whose sum is σ = 113608173630864. Its totient is φ = 106709764597920.
The previous prime is 110132022203911. The next prime is 110132022204091. The reversal of 110132022204011 is 110402220231011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110132022204011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110132022204091) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 13473451040 + ... + 13473459213.
It is an arithmetic number, because the mean of its divisors is an integer number (14201021703858).
Almost surely, 2110132022204011 is an apocalyptic number.
110132022204011 is a deficient number, since it is larger than the sum of its proper divisors (3476151426853).
110132022204011 is an equidigital number, since it uses as much as digits as its factorization.
110132022204011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26946910381.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 110132022204011 its reverse (110402220231011), we get a palindrome (220534242435022).
The spelling of 110132022204011 in words is "one hundred ten trillion, one hundred thirty-two billion, twenty-two million, two hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •