Base | Representation |
---|---|
bin | 1010000001100000100000… |
… | …0010101101110001001111 |
3 | 1110000121011220101200101020 |
4 | 2200120020002231301033 |
5 | 2421032022334323043 |
6 | 35234553120445223 |
7 | 2215146113630622 |
oct | 240301002556117 |
9 | 43017156350336 |
10 | 11021021011023 |
11 | 3569a970526a1 |
12 | 129bb45779813 |
13 | 61c37c4b450a |
14 | 2a15c52b7db9 |
15 | 141a36da6e83 |
hex | a06080adc4f |
11021021011023 has 8 divisors (see below), whose sum is σ = 14694730225200. Its totient is φ = 7347329568768.
The previous prime is 11021021011019. The next prime is 11021021011057. The reversal of 11021021011023 is 32011012012011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11021021011023 - 22 = 11021021011019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11021021010993 and 11021021011011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021021011003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2921568 + ... + 5529701.
It is an arithmetic number, because the mean of its divisors is an integer number (1836841278150).
Almost surely, 211021021011023 is an apocalyptic number.
11021021011023 is a deficient number, since it is larger than the sum of its proper divisors (3673709214177).
11021021011023 is an equidigital number, since it uses as much as digits as its factorization.
11021021011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8885961.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11021021011023 its reverse (32011012012011), we get a palindrome (43032033023034).
The spelling of 11021021011023 in words is "eleven trillion, twenty-one billion, twenty-one million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •