Base | Representation |
---|---|
bin | 110010000100100000011010… |
… | …101001001011001110010001 |
3 | 1001212201001200121200201120220 |
4 | 302010200122221023032101 |
5 | 212330423144102431001 |
6 | 2100204000110023253 |
7 | 64245535620330546 |
oct | 6204403251131621 |
9 | 1055631617621526 |
10 | 220212010202001 |
11 | 64191430931064 |
12 | 208466907a7b29 |
13 | 95b4b98b8908c |
14 | 3c54465078bcd |
15 | 1a6d346982c36 |
hex | c8481aa4b391 |
220212010202001 has 8 divisors (see below), whose sum is σ = 299155938387840. Its totient is φ = 144038044408752.
The previous prime is 220212010201999. The next prime is 220212010202027. The reversal of 220212010202001 is 100202010212022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220212010202001 - 21 = 220212010201999 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (220212010203001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 692490597961 + ... + 692490598278.
It is an arithmetic number, because the mean of its divisors is an integer number (37394492298480).
Almost surely, 2220212010202001 is an apocalyptic number.
It is an amenable number.
220212010202001 is a deficient number, since it is larger than the sum of its proper divisors (78943928185839).
220212010202001 is a wasteful number, since it uses less digits than its factorization.
220212010202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384981196295.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220212010202001 its reverse (100202010212022), we get a palindrome (320414020414023).
The spelling of 220212010202001 in words is "two hundred twenty trillion, two hundred twelve billion, ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •