Base | Representation |
---|---|
bin | 1100111111001100101… |
… | …0101111110111101111 |
3 | 210022220211022110100010 |
4 | 3033303022233313233 |
5 | 12123423442404403 |
6 | 250300140304303 |
7 | 22056124214244 |
oct | 3176312576757 |
9 | 708824273303 |
10 | 223123013103 |
11 | 86698140191 |
12 | 372ab542093 |
13 | 1806aa1b853 |
14 | ab290715cb |
15 | 5c0d482603 |
hex | 33f32afdef |
223123013103 has 8 divisors (see below), whose sum is σ = 298548579328. Its totient is φ = 148223061144.
The previous prime is 223123013089. The next prime is 223123013129. The reversal of 223123013103 is 301310321322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 223123013103 - 29 = 223123012591 is a prime.
It is a super-3 number, since 3×2231230131033 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 223123013103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223123013303) 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, 131402575 + ... + 131404272.
It is an arithmetic number, because the mean of its divisors is an integer number (37318572416).
Almost surely, 2223123013103 is an apocalyptic number.
223123013103 is a deficient number, since it is larger than the sum of its proper divisors (75425566225).
223123013103 is a wasteful number, since it uses less digits than its factorization.
223123013103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262807133.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 223123013103 its reverse (301310321322), we get a palindrome (524433334425).
The spelling of 223123013103 in words is "two hundred twenty-three billion, one hundred twenty-three million, thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •