Base | Representation |
---|---|
bin | 1010100011110110110000… |
… | …10111011000111010101011 |
3 | 10001020000121122220121122201 |
4 | 11101323120113120322223 |
5 | 11020433103120242303 |
6 | 121220050404201031 |
7 | 4614515224304101 |
oct | 521733027307253 |
9 | 101200548817581 |
10 | 23222223212203 |
11 | 7443542668194 |
12 | 2730757699177 |
13 | cc5b002a85c2 |
14 | 5a3d668bbc71 |
15 | 2a40e3a6e81d |
hex | 151ed85d8eab |
23222223212203 has 4 divisors (see below), whose sum is σ = 23222931477120. Its totient is φ = 23221514947288.
The previous prime is 23222223212143. The next prime is 23222223212231. The reversal of 23222223212203 is 30221232222232.
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 23222223212203 - 229 = 23221686341291 is a prime.
It is a super-2 number, since 2×232222232122032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23222223212233) 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, 354083275 + ... + 354148852.
It is an arithmetic number, because the mean of its divisors is an integer number (5805732869280).
Almost surely, 223222223212203 is an apocalyptic number.
23222223212203 is a deficient number, since it is larger than the sum of its proper divisors (708264917).
23222223212203 is an equidigital number, since it uses as much as digits as its factorization.
23222223212203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708264916.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 23222223212203 its reverse (30221232222232), we get a palindrome (53443455434435).
The spelling of 23222223212203 in words is "twenty-three trillion, two hundred twenty-two billion, two hundred twenty-three million, two hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •