Base | Representation |
---|---|
bin | 1010000001100111111101… |
… | …0001010000101111111111 |
3 | 1110000210100022022112212111 |
4 | 2200121333101100233333 |
5 | 2421100121424004043 |
6 | 35235523414114451 |
7 | 2215246513131106 |
oct | 240317721205777 |
9 | 43023308275774 |
10 | 11023021313023 |
11 | 356a923186145 |
12 | 12a040364ba27 |
13 | 61c60aa36175 |
14 | 2a1734c1103d |
15 | 141b027c909d |
hex | a067f450bff |
11023021313023 has 4 divisors (see below), whose sum is σ = 11279370645928. Its totient is φ = 10766671980120.
The previous prime is 11023021313009. The next prime is 11023021313069. The reversal of 11023021313023 is 32031312032011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11023021313023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11023021312985 and 11023021313003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023021313093) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128174666388 + ... + 128174666473.
It is an arithmetic number, because the mean of its divisors is an integer number (2819842661482).
Almost surely, 211023021313023 is an apocalyptic number.
11023021313023 is a deficient number, since it is larger than the sum of its proper divisors (256349332905).
11023021313023 is an equidigital number, since it uses as much as digits as its factorization.
11023021313023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256349332904.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11023021313023 its reverse (32031312032011), we get a palindrome (43054333345034).
The spelling of 11023021313023 in words is "eleven trillion, twenty-three billion, twenty-one million, three hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •