Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …10100101001100100011111 |
3 | 2121220002211221200122001101 |
4 | 10203113021110221210133 |
5 | 10111021001332401343 |
6 | 110330025254053531 |
7 | 4134362165426503 |
oct | 443271124514437 |
9 | 77802757618041 |
10 | 20022220200223 |
11 | 641a41536337a |
12 | 22b453504a2a7 |
13 | b231199435c7 |
14 | 4d311b35c303 |
15 | 24ac559ade4d |
hex | 1235c952991f |
20022220200223 has 4 divisors (see below), whose sum is σ = 20027942473000. Its totient is φ = 20016497927448.
The previous prime is 20022220200221. The next prime is 20022220200233. The reversal of 20022220200223 is 32200202222002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20022220200223 - 21 = 20022220200221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20022220200223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022220200221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2861131140 + ... + 2861138137.
It is an arithmetic number, because the mean of its divisors is an integer number (5006985618250).
Almost surely, 220022220200223 is an apocalyptic number.
20022220200223 is a deficient number, since it is larger than the sum of its proper divisors (5722272777).
20022220200223 is an equidigital number, since it uses as much as digits as its factorization.
20022220200223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5722272776.
The product of its (nonzero) digits is 768, while the sum is 19.
Adding to 20022220200223 its reverse (32200202222002), we get a palindrome (52222422422225).
The spelling of 20022220200223 in words is "twenty trillion, twenty-two billion, two hundred twenty million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •