Base | Representation |
---|---|
bin | 1010000111011100100111… |
… | …0001011010000000001011 |
3 | 1110101100112212021211122112 |
4 | 2201313021301122000023 |
5 | 2424220004202020243 |
6 | 35353510002012535 |
7 | 2225420453531003 |
oct | 241671161320013 |
9 | 43340485254575 |
10 | 11123055501323 |
11 | 35a9296942437 |
12 | 12b788094714b |
13 | 628b9065606c |
14 | 2a6504611003 |
15 | 144509a18818 |
hex | a1dc9c5a00b |
11123055501323 has 4 divisors (see below), whose sum is σ = 11123235080328. Its totient is φ = 11122875922320.
The previous prime is 11123055501281. The next prime is 11123055501331. The reversal of 11123055501323 is 32310555032111.
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 11123055501323 - 210 = 11123055500299 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 11123055501323.
It is not an unprimeable number, because it can be changed into a prime (11123055501373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 89696561 + ... + 89820482.
It is an arithmetic number, because the mean of its divisors is an integer number (2780808770082).
Almost surely, 211123055501323 is an apocalyptic number.
11123055501323 is a deficient number, since it is larger than the sum of its proper divisors (179579005).
11123055501323 is an equidigital number, since it uses as much as digits as its factorization.
11123055501323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179579004.
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 11123055501323 in words is "eleven trillion, one hundred twenty-three billion, fifty-five million, five hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •