Base | Representation |
---|---|
bin | 1001100110011110000001… |
… | …11011111101001000101111 |
3 | 2202202101100100120202222202 |
4 | 10303033000323331020233 |
5 | 10231403411301432343 |
6 | 112523102344332115 |
7 | 4306235565112040 |
oct | 463170073751057 |
9 | 82671310522882 |
10 | 21113001202223 |
11 | 67aaa78844757 |
12 | 244ba1147403b |
13 | ba1c41791c78 |
14 | 52dc362c48c7 |
15 | 2692e6e24db8 |
hex | 1333c0efd22f |
21113001202223 has 8 divisors (see below), whose sum is σ = 24459680454048. Its totient is φ = 17848956006144.
The previous prime is 21113001202171. The next prime is 21113001202301. The reversal of 21113001202223 is 32220210031112.
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 21113001202223 - 222 = 21112997007919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21113001202195 and 21113001202204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113001202123) 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, 20658513386 + ... + 20658514407.
It is an arithmetic number, because the mean of its divisors is an integer number (3057460056756).
Almost surely, 221113001202223 is an apocalyptic number.
21113001202223 is a deficient number, since it is larger than the sum of its proper divisors (3346679251825).
21113001202223 is an equidigital number, since it uses as much as digits as its factorization.
21113001202223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41317027873.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21113001202223 its reverse (32220210031112), we get a palindrome (53333211233335).
The spelling of 21113001202223 in words is "twenty-one trillion, one hundred thirteen billion, one million, two hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •