Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …011111010011000101111 |
3 | 10220100222022000102112000 |
4 | 100002200103322120233 |
5 | 121024302001432343 |
6 | 2202202204543343 |
7 | 142426400431512 |
oct | 20024023723057 |
9 | 3810868012460 |
10 | 1102201202223 |
11 | 395493931890 |
12 | 159744b51b53 |
13 | 7cc24b3abb4 |
14 | 3b4bd978d79 |
15 | 1da0dd58ed3 |
hex | 100a04fa62f |
1102201202223 has 64 divisors (see below), whose sum is σ = 1898333798400. Its totient is φ = 625362202080.
The previous prime is 1102201202213. The next prime is 1102201202243. The reversal of 1102201202223 is 3222021022011.
It is not a de Polignac number, because 1102201202223 - 218 = 1102200940079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102201202196 and 1102201202205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102201202213) 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 63 ways as a sum of consecutive naturals, for example, 1395463 + ... + 2037576.
It is an arithmetic number, because the mean of its divisors is an integer number (29661465600).
Almost surely, 21102201202223 is an apocalyptic number.
1102201202223 is a deficient number, since it is larger than the sum of its proper divisors (796132596177).
1102201202223 is a wasteful number, since it uses less digits than its factorization.
1102201202223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3433129 (or 3433123 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 1102201202223 its reverse (3222021022011), we get a palindrome (4324222224234).
The spelling of 1102201202223 in words is "one trillion, one hundred two billion, two hundred one million, two hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •