Base | Representation |
---|---|
bin | 1010010100001101000100… |
… | …0011111001001000010111 |
3 | 1111011022020220001211102120 |
4 | 2211003101003321020113 |
5 | 2441312332101320043 |
6 | 40042313333511023 |
7 | 2250306545541243 |
oct | 245032103711027 |
9 | 44138226054376 |
10 | 11342221120023 |
11 | 3683233149632 |
12 | 1332246aa2473 |
13 | 64374a51ca01 |
14 | 2b2d75c5d423 |
15 | 14a08583e983 |
hex | a50d10f9217 |
11342221120023 has 32 divisors (see below), whose sum is σ = 16007862124800. Its totient is φ = 7123483180800.
The previous prime is 11342221119961. The next prime is 11342221120051. The reversal of 11342221120023 is 32002112224311.
It is not a de Polignac number, because 11342221120023 - 217 = 11342220988951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11342221119975 and 11342221120002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11342221120523) 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 31 ways as a sum of consecutive naturals, for example, 256757728 + ... + 256801898.
It is an arithmetic number, because the mean of its divisors is an integer number (500245691400).
Almost surely, 211342221120023 is an apocalyptic number.
11342221120023 is a deficient number, since it is larger than the sum of its proper divisors (4665641004777).
11342221120023 is a wasteful number, since it uses less digits than its factorization.
11342221120023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69263.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 11342221120023 its reverse (32002112224311), we get a palindrome (43344333344334).
The spelling of 11342221120023 in words is "eleven trillion, three hundred forty-two billion, two hundred twenty-one million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •