Base | Representation |
---|---|
bin | 1010100011111000100101… |
… | …00110011000010000111101 |
3 | 10001020010010202022202200212 |
4 | 11101330102212120100331 |
5 | 11020442103224021341 |
6 | 121220331345002205 |
7 | 4614551356605011 |
oct | 521742246302075 |
9 | 101203122282625 |
10 | 23223200220221 |
11 | 74439a4107831 |
12 | 273098a923365 |
13 | cc5c27825561 |
14 | 5a401a562541 |
15 | 2a414e70d5eb |
hex | 151f1299843d |
23223200220221 has 4 divisors (see below), whose sum is σ = 23362261299552. Its totient is φ = 23084139140892.
The previous prime is 23223200220217. The next prime is 23223200220239. The reversal of 23223200220221 is 12202200232232.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23223200220221 - 22 = 23223200220217 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23223200225221) 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, 69530539415 + ... + 69530539748.
It is an arithmetic number, because the mean of its divisors is an integer number (5840565324888).
Almost surely, 223223200220221 is an apocalyptic number.
It is an amenable number.
23223200220221 is a deficient number, since it is larger than the sum of its proper divisors (139061079331).
23223200220221 is a wasteful number, since it uses less digits than its factorization.
23223200220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139061079330.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 23223200220221 its reverse (12202200232232), we get a palindrome (35425400452453).
The spelling of 23223200220221 in words is "twenty-three trillion, two hundred twenty-three billion, two hundred million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •