Base | Representation |
---|---|
bin | 1010000010001101111101… |
… | …0110000010101001101011 |
3 | 1110001202200021210200222001 |
4 | 2200203133112002221223 |
5 | 2421232020104111243 |
6 | 35244332010111431 |
7 | 2216060361036115 |
oct | 240433726025153 |
9 | 43052607720861 |
10 | 11033223113323 |
11 | 35741888a2764 |
12 | 12a239011b577 |
13 | 62057548b1a8 |
14 | 2a2021aa43b5 |
15 | 141eed249a4d |
hex | a08df582a6b |
11033223113323 has 4 divisors (see below), whose sum is σ = 11331418332640. Its totient is φ = 10735027894008.
The previous prime is 11033223113189. The next prime is 11033223113417. The reversal of 11033223113323 is 32331132233011.
It is a happy number.
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-11033223113323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11033223113291 and 11033223113300.
It is not an unprimeable number, because it can be changed into a prime (11033223113123) 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, 149097609603 + ... + 149097609676.
It is an arithmetic number, because the mean of its divisors is an integer number (2832854583160).
Almost surely, 211033223113323 is an apocalyptic number.
11033223113323 is a deficient number, since it is larger than the sum of its proper divisors (298195219317).
11033223113323 is an equidigital number, since it uses as much as digits as its factorization.
11033223113323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298195219316.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 11033223113323 its reverse (32331132233011), we get a palindrome (43364355346334).
The spelling of 11033223113323 in words is "eleven trillion, thirty-three billion, two hundred twenty-three million, one hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •