Base | Representation |
---|---|
bin | 1010001101001110010101… |
… | …0101001111111101110001 |
3 | 1110201211201112022221202212 |
4 | 2203103211111033331301 |
5 | 2432331233321130113 |
6 | 35511242053421505 |
7 | 2235533052126521 |
oct | 243234525177561 |
9 | 43654645287685 |
10 | 11222302130033 |
11 | 3637395a95535 |
12 | 1312b5a33a895 |
13 | 63534905a677 |
14 | 2ab23b5a3681 |
15 | 146db7a3c0a8 |
hex | a34e554ff71 |
11222302130033 has 8 divisors (see below), whose sum is σ = 11314678868640. Its totient is φ = 11130091688160.
The previous prime is 11222302130029. The next prime is 11222302130071. The reversal of 11222302130033 is 33003120322211.
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 11222302130033 - 22 = 11222302130029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11222302129990 and 11222302130008.
It is not an unprimeable number, because it can be changed into a prime (11222302130023) 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, 41438660 + ... + 41708597.
It is an arithmetic number, because the mean of its divisors is an integer number (1414334858580).
Almost surely, 211222302130033 is an apocalyptic number.
It is an amenable number.
11222302130033 is a deficient number, since it is larger than the sum of its proper divisors (92376738607).
11222302130033 is an equidigital number, since it uses as much as digits as its factorization.
11222302130033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83148367.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 11222302130033 its reverse (33003120322211), we get a palindrome (44225422452244).
The spelling of 11222302130033 in words is "eleven trillion, two hundred twenty-two billion, three hundred two million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •