Base | Representation |
---|---|
bin | 1010000001101000101111… |
… | …1001111011101011011101 |
3 | 1110000210220002012122222221 |
4 | 2200122023321323223131 |
5 | 2421101040211114323 |
6 | 35240000425505341 |
7 | 2215254666035350 |
oct | 240321371735335 |
9 | 43023802178887 |
10 | 11023233301213 |
11 | 356aa21906aa1 |
12 | 12a0462642251 |
13 | 61c642929c73 |
14 | 2a1755034297 |
15 | 141b1620055d |
hex | a068be7badd |
11023233301213 has 4 divisors (see below), whose sum is σ = 12597980915680. Its totient is φ = 9448485686748.
The previous prime is 11023233301177. The next prime is 11023233301229. The reversal of 11023233301213 is 31210333232011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11023233301213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023233301273) 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, 787373807223 + ... + 787373807236.
It is an arithmetic number, because the mean of its divisors is an integer number (3149495228920).
Almost surely, 211023233301213 is an apocalyptic number.
It is an amenable number.
11023233301213 is a deficient number, since it is larger than the sum of its proper divisors (1574747614467).
11023233301213 is an equidigital number, since it uses as much as digits as its factorization.
11023233301213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1574747614466.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 11023233301213 its reverse (31210333232011), we get a palindrome (42233566533224).
The spelling of 11023233301213 in words is "eleven trillion, twenty-three billion, two hundred thirty-three million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •