Base | Representation |
---|---|
bin | 110010101101100010111100… |
… | …110110000000111111010011 |
3 | 1002020200200011120211122200101 |
4 | 302231202330312000333103 |
5 | 213213130001341214443 |
6 | 2110203331512233231 |
7 | 64656355401304513 |
oct | 6255427466007723 |
9 | 1066620146748611 |
10 | 223032230023123 |
11 | 6507948a456504 |
12 | 2102118269b817 |
13 | 975ab0647b8c1 |
14 | 3d10b63437843 |
15 | 1abb8a7e4084d |
hex | cad8bcd80fd3 |
223032230023123 has 2 divisors, whose sum is σ = 223032230023124. Its totient is φ = 223032230023122.
The previous prime is 223032230023087. The next prime is 223032230023237. The reversal of 223032230023123 is 321320032230322.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 223032230023123 - 217 = 223032229892051 is a prime.
It is a super-2 number, since 2×2230322300231232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 223032230023091 and 223032230023100.
It is not a weakly prime, because it can be changed into another prime (223032230083123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111516115011561 + 111516115011562.
It is an arithmetic number, because the mean of its divisors is an integer number (111516115011562).
Almost surely, 2223032230023123 is an apocalyptic number.
223032230023123 is a deficient number, since it is larger than the sum of its proper divisors (1).
223032230023123 is an equidigital number, since it uses as much as digits as its factorization.
223032230023123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 223032230023123 its reverse (321320032230322), we get a palindrome (544352262253445).
The spelling of 223032230023123 in words is "two hundred twenty-three trillion, thirty-two billion, two hundred thirty million, twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •