Base | Representation |
---|---|
bin | 1010000001101000101111… |
… | …1001010001111011101111 |
3 | 1110000210220001212222102222 |
4 | 2200122023321101323233 |
5 | 2421101040140131343 |
6 | 35240000422105555 |
7 | 2215254664424006 |
oct | 240321371217357 |
9 | 43023801788388 |
10 | 11023233130223 |
11 | 356aa217aa586 |
12 | 12a046257b2bb |
13 | 61c64289a1a2 |
14 | 2a1754dcbc3d |
15 | 141b161b9a68 |
hex | a068be51eef |
11023233130223 has 8 divisors (see below), whose sum is σ = 11055507358080. Its totient is φ = 10990975688280.
The previous prime is 11023233130201. The next prime is 11023233130253. The reversal of 11023233130223 is 32203133232011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11023233130223 - 28 = 11023233129967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11023233130192 and 11023233130201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023233130253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2880563 + ... + 5508548.
It is an arithmetic number, because the mean of its divisors is an integer number (1381938419760).
Almost surely, 211023233130223 is an apocalyptic number.
11023233130223 is a deficient number, since it is larger than the sum of its proper divisors (32274227857).
11023233130223 is an equidigital number, since it uses as much as digits as its factorization.
11023233130223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8392957.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 11023233130223 its reverse (32203133232011), we get a palindrome (43226366362234).
The spelling of 11023233130223 in words is "eleven trillion, twenty-three billion, two hundred thirty-three million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •