Base | Representation |
---|---|
bin | 10000000010100110010… |
… | …101101001111000100101 |
3 | 10220101020100021212001211 |
4 | 100002212111221320211 |
5 | 121030003343302323 |
6 | 2202220220151421 |
7 | 142432036100131 |
oct | 20024625517045 |
9 | 3811210255054 |
10 | 1102302322213 |
11 | 395535a18824 |
12 | 159772998571 |
13 | 7cc3ca84401 |
14 | 3b4cd17c3c1 |
15 | 1da17b8070d |
hex | 100a6569e25 |
1102302322213 has 8 divisors (see below), whose sum is σ = 1148326522560. Its totient is φ = 1057189492320.
The previous prime is 1102302322211. The next prime is 1102302322223. The reversal of 1102302322213 is 3122232032011.
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 1102302322213 - 21 = 1102302322211 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 (1102302322211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 227840145 + ... + 227844982.
It is an arithmetic number, because the mean of its divisors is an integer number (143540815320).
Almost surely, 21102302322213 is an apocalyptic number.
It is an amenable number.
1102302322213 is a deficient number, since it is larger than the sum of its proper divisors (46024200347).
1102302322213 is an equidigital number, since it uses as much as digits as its factorization.
1102302322213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455685227.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1102302322213 its reverse (3122232032011), we get a palindrome (4224534354224).
The spelling of 1102302322213 in words is "one trillion, one hundred two billion, three hundred two million, three hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •