Base | Representation |
---|---|
bin | 1100111111110111001… |
… | …0001001010110001111 |
3 | 210100101020102212210011 |
4 | 3033331302021112033 |
5 | 12124310041110411 |
6 | 250325541454051 |
7 | 22063416100510 |
oct | 3177562112617 |
9 | 710336385704 |
10 | 223301113231 |
11 | 86779725479 |
12 | 3733b111327 |
13 | 180988a8a41 |
14 | ab44992a07 |
15 | 5c1de12c21 |
hex | 33fdc8958f |
223301113231 has 32 divisors (see below), whose sum is σ = 258887121920. Its totient is φ = 188661747456.
The previous prime is 223301113213. The next prime is 223301113237. The reversal of 223301113231 is 132311103322.
It is not a de Polignac number, because 223301113231 - 225 = 223267558799 is a prime.
It is a super-2 number, since 2×2233011132312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223301113237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84358750 + ... + 84361396.
It is an arithmetic number, because the mean of its divisors is an integer number (8090222560).
Almost surely, 2223301113231 is an apocalyptic number.
223301113231 is a deficient number, since it is larger than the sum of its proper divisors (35586008689).
223301113231 is a wasteful number, since it uses less digits than its factorization.
223301113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3383.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 223301113231 its reverse (132311103322), we get a palindrome (355612216553).
Subtracting from 223301113231 its reverse (132311103322), we obtain a palindrome (90990009909).
The spelling of 223301113231 in words is "two hundred twenty-three billion, three hundred one million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •