Base | Representation |
---|---|
bin | 10000000011100010111… |
… | …111110111110011000101 |
3 | 10220110212021021101000102 |
4 | 100003202333313303011 |
5 | 121034044411202323 |
6 | 2202505213053445 |
7 | 142466204310413 |
oct | 20034277676305 |
9 | 3813767241012 |
10 | 1103320022213 |
11 | 395a08430902 |
12 | 1599b7787285 |
13 | 8007287ab66 |
14 | 3b5883b62b3 |
15 | 1da771ab328 |
hex | 100e2ff7cc5 |
1103320022213 has 4 divisors (see below), whose sum is σ = 1107246428268. Its totient is φ = 1099393616160.
The previous prime is 1103320022201. The next prime is 1103320022237. The reversal of 1103320022213 is 3122200233011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 521886321889 + 581433700324 = 722417^2 + 762518^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103320022213 - 24 = 1103320022197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103320022293) 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, 1963202606 + ... + 1963203167.
It is an arithmetic number, because the mean of its divisors is an integer number (276811607067).
Almost surely, 21103320022213 is an apocalyptic number.
It is an amenable number.
1103320022213 is a deficient number, since it is larger than the sum of its proper divisors (3926406055).
1103320022213 is an equidigital number, since it uses as much as digits as its factorization.
1103320022213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3926406054.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1103320022213 its reverse (3122200233011), we get a palindrome (4225520255224).
The spelling of 1103320022213 in words is "one trillion, one hundred three billion, three hundred twenty million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •