Base | Representation |
---|---|
bin | 1010000110101100010110… |
… | …01100000101001100001111 |
3 | 2220200020020000101022000111 |
4 | 11003112023030011030033 |
5 | 10403023432430202343 |
6 | 115131452555140451 |
7 | 4452233203233331 |
oct | 503261314051417 |
9 | 86606200338014 |
10 | 22220201022223 |
11 | 709759721a006 |
12 | 25aa510444727 |
13 | c52482096559 |
14 | 56b66ba81451 |
15 | 287ee9a10c9d |
hex | 14358b30530f |
22220201022223 has 8 divisors (see below), whose sum is σ = 22643990060688. Its totient is φ = 21796580130624.
The previous prime is 22220201022221. The next prime is 22220201022281. The reversal of 22220201022223 is 32222010202222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22220201022223 - 21 = 22220201022221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22220201022194 and 22220201022203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22220201022221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41769886 + ... + 42298507.
It is an arithmetic number, because the mean of its divisors is an integer number (2830498757586).
Almost surely, 222220201022223 is an apocalyptic number.
22220201022223 is a deficient number, since it is larger than the sum of its proper divisors (423789038465).
22220201022223 is an equidigital number, since it uses as much as digits as its factorization.
22220201022223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84073433.
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 22220201022223 its reverse (32222010202222), we get a palindrome (54442211224445).
The spelling of 22220201022223 in words is "twenty-two trillion, two hundred twenty billion, two hundred one million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •