Base | Representation |
---|---|
bin | 110010000100011110100011… |
… | …011111101000100011110101 |
3 | 1001212200212112022020111211222 |
4 | 302010132203133220203311 |
5 | 212330410100332241041 |
6 | 2100203025500440125 |
7 | 64245435235233455 |
oct | 6204364337504365 |
9 | 1055625468214758 |
10 | 220210011212021 |
11 | 641905a5514326 |
12 | 20846213249045 |
13 | 95b493a9a667c |
14 | 3c543157a3d65 |
15 | 1a6d27b21e74b |
hex | c847a37e88f5 |
220210011212021 has 16 divisors (see below), whose sum is σ = 220636045862400. Its totient is φ = 219784407118848.
The previous prime is 220210011212003. The next prime is 220210011212029. The reversal of 220210011212021 is 120212110012022.
It is a cyclic number.
It is not a de Polignac number, because 220210011212021 - 210 = 220210011210997 is a prime.
It is a super-3 number, since 3×2202100112120213 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220210011212029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15042687620 + ... + 15042702258.
It is an arithmetic number, because the mean of its divisors is an integer number (13789752866400).
Almost surely, 2220210011212021 is an apocalyptic number.
It is an amenable number.
220210011212021 is a deficient number, since it is larger than the sum of its proper divisors (426034650379).
220210011212021 is a wasteful number, since it uses less digits than its factorization.
220210011212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27428.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 220210011212021 its reverse (120212110012022), we get a palindrome (340422121224043).
The spelling of 220210011212021 in words is "two hundred twenty trillion, two hundred ten billion, eleven million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •