Base | Representation |
---|---|
bin | 110100100100011100110010… |
… | …100010000100100001110111 |
3 | 1010022121210221210011221111011 |
4 | 310210130302202010201313 |
5 | 220301013204432200343 |
6 | 2135421144300453051 |
7 | 66461611425600445 |
oct | 6444346242044167 |
9 | 1108553853157434 |
10 | 231203232303223 |
11 | 677398161a7774 |
12 | 21b2089a84a187 |
13 | 9c014a9854a8b |
14 | 41144208d1b95 |
15 | 1bae1d76d329d |
hex | d24732884877 |
231203232303223 has 4 divisors (see below), whose sum is σ = 235121931155880. Its totient is φ = 227284533450568.
The previous prime is 231203232303217. The next prime is 231203232303271. The reversal of 231203232303223 is 322303232302132.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 231203232303223 - 213 = 231203232295031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231203232303203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1959349426240 + ... + 1959349426357.
It is an arithmetic number, because the mean of its divisors is an integer number (58780482788970).
Almost surely, 2231203232303223 is an apocalyptic number.
231203232303223 is a deficient number, since it is larger than the sum of its proper divisors (3918698852657).
231203232303223 is an equidigital number, since it uses as much as digits as its factorization.
231203232303223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3918698852656.
The product of its (nonzero) digits is 46656, while the sum is 31.
Adding to 231203232303223 its reverse (322303232302132), we get a palindrome (553506464605355).
The spelling of 231203232303223 in words is "two hundred thirty-one trillion, two hundred three billion, two hundred thirty-two million, three hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •