Base | Representation |
---|---|
bin | 1100111111001010000… |
… | …1001111001000111011 |
3 | 210022220001211121002010 |
4 | 3033302201033020323 |
5 | 12123413201144011 |
6 | 250255111141003 |
7 | 22055632552341 |
oct | 3176241171073 |
9 | 708801747063 |
10 | 223112131131 |
11 | 86691a8841a |
12 | 372a7974763 |
13 | 180686ab706 |
14 | ab2783b991 |
15 | 5c0c5331a6 |
hex | 33f284f23b |
223112131131 has 8 divisors (see below), whose sum is σ = 299040344064. Its totient is φ = 147962669480.
The previous prime is 223112131129. The next prime is 223112131141. The reversal of 223112131131 is 131131211322.
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 223112131131 - 21 = 223112131129 is a prime.
It is a super-3 number, since 3×2231121311313 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 223112131098 and 223112131107.
It is not an unprimeable number, because it can be changed into a prime (223112131141) 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, 194687151 + ... + 194688296.
It is an arithmetic number, because the mean of its divisors is an integer number (37380043008).
Almost surely, 2223112131131 is an apocalyptic number.
223112131131 is a deficient number, since it is larger than the sum of its proper divisors (75928212933).
223112131131 is a wasteful number, since it uses less digits than its factorization.
223112131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389375641.
The product of its digits is 216, while the sum is 21.
Adding to 223112131131 its reverse (131131211322), we get a palindrome (354243342453).
The spelling of 223112131131 in words is "two hundred twenty-three billion, one hundred twelve million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •