Base | Representation |
---|---|
bin | 10001110010011000100… |
… | …111001001001011110101 |
3 | 11022212001100122001011112 |
4 | 101302120213021023311 |
5 | 130011313231011013 |
6 | 2333310421444405 |
7 | 154211335002260 |
oct | 21623047111365 |
9 | 4285040561145 |
10 | 1222331110133 |
11 | 43142a055711 |
12 | 178a90270705 |
13 | 8b35ac0ab43 |
14 | 43238259cd7 |
15 | 21be0420ba8 |
hex | 11c989c92f5 |
1222331110133 has 8 divisors (see below), whose sum is σ = 1397022975360. Its totient is φ = 1047657528720.
The previous prime is 1222331110081. The next prime is 1222331110163. The reversal of 1222331110133 is 3310111332221.
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 1222331110133 - 218 = 1222330847989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1222331110099 and 1222331110108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222331110163) 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, 4427393 + ... + 4695366.
It is an arithmetic number, because the mean of its divisors is an integer number (174627871920).
Almost surely, 21222331110133 is an apocalyptic number.
It is an amenable number.
1222331110133 is a deficient number, since it is larger than the sum of its proper divisors (174691865227).
1222331110133 is an equidigital number, since it uses as much as digits as its factorization.
1222331110133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9141907.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1222331110133 its reverse (3310111332221), we get a palindrome (4532442442354).
The spelling of 1222331110133 in words is "one trillion, two hundred twenty-two billion, three hundred thirty-one million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •