Base | Representation |
---|---|
bin | 10000000010100001100… |
… | …100000001010010010001 |
3 | 10220101000202112022210120 |
4 | 100002201210001102101 |
5 | 121024322340431001 |
6 | 2202204235020453 |
7 | 142430044063404 |
oct | 20024144012221 |
9 | 3811022468716 |
10 | 1102222202001 |
11 | 3954a4775278 |
12 | 15974bb9a729 |
13 | 7cc292b13bb |
14 | 3b4c2683d3b |
15 | 1da10b06236 |
hex | 100a1901491 |
1102222202001 has 8 divisors (see below), whose sum is σ = 1471297744224. Its totient is φ = 733980730560.
The previous prime is 1102222201987. The next prime is 1102222202033. The reversal of 1102222202001 is 1002022222011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1102222202001 - 215 = 1102222169233 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1102222202041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 208514611 + ... + 208519896.
It is an arithmetic number, because the mean of its divisors is an integer number (183912218028).
Almost surely, 21102222202001 is an apocalyptic number.
It is an amenable number.
1102222202001 is a deficient number, since it is larger than the sum of its proper divisors (369075542223).
1102222202001 is an equidigital number, since it uses as much as digits as its factorization.
1102222202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417035391.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1102222202001 its reverse (1002022222011), we get a palindrome (2104244424012).
It can be divided in two parts, 1102222 and 202001, that multiplied together give a palindrome (222649946222).
The spelling of 1102222202001 in words is "one trillion, one hundred two billion, two hundred twenty-two million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •