Base | Representation |
---|---|
bin | 1010000001100001100011… |
… | …0111010001001011101111 |
3 | 1110000121220120102112110112 |
4 | 2200120120313101023233 |
5 | 2421033112111114043 |
6 | 35235041121330235 |
7 | 2215156111453262 |
oct | 240303067211357 |
9 | 43017816375415 |
10 | 11021303223023 |
11 | 356a121387755 |
12 | 12a000419697b |
13 | 61c3c5ac4972 |
14 | 2a161097acd9 |
15 | 141a51a50518 |
hex | a0618dd12ef |
11021303223023 has 8 divisors (see below), whose sum is σ = 11024697517680. Its totient is φ = 11017909445760.
The previous prime is 11021303223013. The next prime is 11021303223041. The reversal of 11021303223023 is 32032230312011.
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 11021303223023 - 28 = 11021303222767 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 11021303223023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021303223013) 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, 44857073 + ... + 45102101.
It is an arithmetic number, because the mean of its divisors is an integer number (1378087189710).
Almost surely, 211021303223023 is an apocalyptic number.
11021303223023 is a deficient number, since it is larger than the sum of its proper divisors (3394294657).
11021303223023 is an equidigital number, since it uses as much as digits as its factorization.
11021303223023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258697.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 11021303223023 its reverse (32032230312011), we get a palindrome (43053533535034).
The spelling of 11021303223023 in words is "eleven trillion, twenty-one billion, three hundred three million, two hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •