Base | Representation |
---|---|
bin | 1010000001101001011001… |
… | …1100111111000000001111 |
3 | 1110000211100102012012121022 |
4 | 2200122112130333000033 |
5 | 2421101421011341111 |
6 | 35240030150424355 |
7 | 2215262245135166 |
oct | 240322634770017 |
9 | 43024312165538 |
10 | 11023410262031 |
11 | 3570002793302 |
12 | 12a04b19620bb |
13 | 61c6704a86cb |
14 | 2a177073a3dd |
15 | 141b26a082db |
hex | a069673f00f |
11023410262031 has 8 divisors (see below), whose sum is σ = 11259615869184. Its totient is φ = 10787274028440.
The previous prime is 11023410262021. The next prime is 11023410262037. The reversal of 11023410262031 is 13026201432011.
It is a happy number.
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 11023410262031 - 26 = 11023410261967 is a prime.
It is a super-2 number, since 2×110234102620312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023410262037) 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, 17022125 + ... + 17657846.
It is an arithmetic number, because the mean of its divisors is an integer number (1407451983648).
Almost surely, 211023410262031 is an apocalyptic number.
11023410262031 is a deficient number, since it is larger than the sum of its proper divisors (236205607153).
11023410262031 is an equidigital number, since it uses as much as digits as its factorization.
11023410262031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34686781.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 11023410262031 its reverse (13026201432011), we get a palindrome (24049611694042).
The spelling of 11023410262031 in words is "eleven trillion, twenty-three billion, four hundred ten million, two hundred sixty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •