Base | Representation |
---|---|
bin | 1100111011000110011… |
… | …0100110110111110101 |
3 | 210020002011111000111121 |
4 | 3032301212212313311 |
5 | 12114200343120041 |
6 | 245555043503541 |
7 | 22016636350315 |
oct | 3166146466765 |
9 | 706064430447 |
10 | 222023020021 |
11 | 861832300a0 |
12 | 37043087bb1 |
13 | 17c23b7107a |
14 | aa62d35445 |
15 | 5b96aed7d1 |
hex | 33b19a6df5 |
222023020021 has 16 divisors (see below), whose sum is σ = 253112859648. Its totient is φ = 192950578800.
The previous prime is 222023019989. The next prime is 222023020057. The reversal of 222023020021 is 120020320222.
It is a cyclic number.
It is not a de Polignac number, because 222023020021 - 25 = 222023019989 is a prime.
It is a super-3 number, since 3×2220230200213 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222023019977 and 222023020004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222023020321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4971315 + ... + 5015776.
It is an arithmetic number, because the mean of its divisors is an integer number (15819553728).
Almost surely, 2222023020021 is an apocalyptic number.
It is an amenable number.
222023020021 is a deficient number, since it is larger than the sum of its proper divisors (31089839627).
222023020021 is a wasteful number, since it uses less digits than its factorization.
222023020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9987192.
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 222023020021 its reverse (120020320222), we get a palindrome (342043340243).
The spelling of 222023020021 in words is "two hundred twenty-two billion, twenty-three million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •