Base | Representation |
---|---|
bin | 1001100011110001001011… |
… | …01011111001011110010111 |
3 | 2202102111211000220121001002 |
4 | 10301320211223321132113 |
5 | 10223343333231224343 |
6 | 112412314140053515 |
7 | 4266442130521625 |
oct | 461704553713627 |
9 | 82374730817032 |
10 | 21020202211223 |
11 | 6774688175266 |
12 | 2435a3323429b |
13 | b96272b06ac7 |
14 | 529551786515 |
15 | 266bb4eac8b8 |
hex | 131e25af9797 |
21020202211223 has 8 divisors (see below), whose sum is σ = 21442896092736. Its totient is φ = 20598474488800.
The previous prime is 21020202211181. The next prime is 21020202211231. The reversal of 21020202211223 is 32211220202012.
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 21020202211223 - 28 = 21020202210967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020202211195 and 21020202211204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020202211123) 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, 241495823 + ... + 241582848.
It is an arithmetic number, because the mean of its divisors is an integer number (2680362011592).
Almost surely, 221020202211223 is an apocalyptic number.
21020202211223 is a deficient number, since it is larger than the sum of its proper divisors (422693881513).
21020202211223 is an equidigital number, since it uses as much as digits as its factorization.
21020202211223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 483079545.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 21020202211223 its reverse (32211220202012), we get a palindrome (53231422413235).
The spelling of 21020202211223 in words is "twenty-one trillion, twenty billion, two hundred two million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.369 sec. • engine limits •