Base | Representation |
---|---|
bin | 11001000001000011001110… |
… | …010010111010101111001011 |
3 | 112102120010110222010022012220 |
4 | 121001003032102322233023 |
5 | 103410110301342220021 |
6 | 1030000005352105123 |
7 | 32113632004462242 |
oct | 3101031622725713 |
9 | 472503428108186 |
10 | 110023343320011 |
11 | 32069702002000 |
12 | 1040b3170951a3 |
13 | 4951206518154 |
14 | 1d2523027b959 |
15 | cabe5dc3bcc6 |
hex | 6410ce4babcb |
110023343320011 has 16 divisors (see below), whose sum is σ = 161356548586368. Its totient is φ = 66680814130920.
The previous prime is 110023343320003. The next prime is 110023343320049.
110023343320011 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 110023343320011 - 23 = 110023343320003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110023343320091) 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 15 ways as a sum of consecutive naturals, for example, 13777023721 + ... + 13777031706.
It is an arithmetic number, because the mean of its divisors is an integer number (10084784286648).
Almost surely, 2110023343320011 is an apocalyptic number.
110023343320011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110023343320011 is a deficient number, since it is larger than the sum of its proper divisors (51333205266357).
110023343320011 is an equidigital number, since it uses as much as digits as its factorization.
110023343320011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27554055463 (or 27554055441 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
The spelling of 110023343320011 in words is "one hundred ten trillion, twenty-three billion, three hundred forty-three million, three hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •