Base | Representation |
---|---|
bin | 1010000001100001101010… |
… | …0010000110110110101011 |
3 | 1110000121222112010102222112 |
4 | 2200120122202012312223 |
5 | 2421033141243330443 |
6 | 35235044001512535 |
7 | 2215156601511524 |
oct | 240303242066653 |
9 | 43017875112875 |
10 | 11021331230123 |
11 | 356a136176915 |
12 | 12a001164274b |
13 | 61c3cb84c806 |
14 | 2a161458b84b |
15 | 141a54233b18 |
hex | a061a886dab |
11021331230123 has 4 divisors (see below), whose sum is σ = 11401377134640. Its totient is φ = 10641285325608.
The previous prime is 11021331230111. The next prime is 11021331230183. The reversal of 11021331230123 is 32103213312011.
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-11021331230123 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11021331230183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 190022952215 + ... + 190022952272.
It is an arithmetic number, because the mean of its divisors is an integer number (2850344283660).
Almost surely, 211021331230123 is an apocalyptic number.
11021331230123 is a deficient number, since it is larger than the sum of its proper divisors (380045904517).
11021331230123 is an equidigital number, since it uses as much as digits as its factorization.
11021331230123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380045904516.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11021331230123 its reverse (32103213312011), we get a palindrome (43124544542134).
The spelling of 11021331230123 in words is "eleven trillion, twenty-one billion, three hundred thirty-one million, two hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •