Base | Representation |
---|---|
bin | 110010110000010011111001… |
… | …110110000100110100111111 |
3 | 1002021100211121011002122121012 |
4 | 302300103321312010310333 |
5 | 213224233112343310142 |
6 | 2110430513330225435 |
7 | 65006163000453404 |
oct | 6260237166046477 |
9 | 1067324534078535 |
10 | 223222232010047 |
11 | 6514202063a486 |
12 | 21051b69a2527b |
13 | 97729c6327aba |
14 | 3d1a0297522ab |
15 | 1ac17c879a882 |
hex | cb04f9d84d3f |
223222232010047 has 2 divisors, whose sum is σ = 223222232010048. Its totient is φ = 223222232010046.
The previous prime is 223222232010007. The next prime is 223222232010061. The reversal of 223222232010047 is 740010232222322.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 223222232010047 - 236 = 223153512533311 is a prime.
It is a super-3 number, since 3×2232222320100473 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 223222232009995 and 223222232010022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223222232010007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111611116005023 + 111611116005024.
It is an arithmetic number, because the mean of its divisors is an integer number (111611116005024).
Almost surely, 2223222232010047 is an apocalyptic number.
223222232010047 is a deficient number, since it is larger than the sum of its proper divisors (1).
223222232010047 is an equidigital number, since it uses as much as digits as its factorization.
223222232010047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32256, while the sum is 32.
Adding to 223222232010047 its reverse (740010232222322), we get a palindrome (963232464232369).
The spelling of 223222232010047 in words is "two hundred twenty-three trillion, two hundred twenty-two billion, two hundred thirty-two million, ten thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •