Base | Representation |
---|---|
bin | 110010010000010001000111… |
… | …001111001010100111001010 |
3 | 1001222120022210121100122112002 |
4 | 302100101013033022213022 |
5 | 212432143343311210442 |
6 | 2102023141143551002 |
7 | 64361116620132653 |
oct | 6220210717124712 |
9 | 1058508717318462 |
10 | 221020212210122 |
11 | 64473166897966 |
12 | 20957245a5b462 |
13 | 9643169186ba0 |
14 | 3c8161485052a |
15 | 1a84399d74732 |
hex | c904473ca9ca |
221020212210122 has 8 divisors (see below), whose sum is σ = 357032650493316. Its totient is φ = 102009328712352.
The previous prime is 221020212210113. The next prime is 221020212210131. The reversal of 221020212210122 is 221012212020122.
It is an interprime number because it is at equal distance from previous prime (221020212210113) and next prime (221020212210131).
It can be written as a sum of positive squares in 2 ways, for example, as 155333871816601 + 65686340393521 = 12463301^2 + 8104711^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 221020212210094 and 221020212210103.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4250388696323 + ... + 4250388696374.
Almost surely, 2221020212210122 is an apocalyptic number.
221020212210122 is a deficient number, since it is larger than the sum of its proper divisors (136012438283194).
221020212210122 is a wasteful number, since it uses less digits than its factorization.
221020212210122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8500777392712.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 221020212210122 its reverse (221012212020122), we get a palindrome (442032424230244).
The spelling of 221020212210122 in words is "two hundred twenty-one trillion, twenty billion, two hundred twelve million, two hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •