Base | Representation |
---|---|
bin | 1011001100100011100011… |
… | …1010011011011100110111 |
3 | 1121120212010010210221212120 |
4 | 2303020320322123130313 |
5 | 3103143024231024343 |
6 | 42103142114451023 |
7 | 2410251323643555 |
oct | 263107072333467 |
9 | 47525103727776 |
10 | 12310331111223 |
11 | 3a16866a89952 |
12 | 14699a8b93a73 |
13 | 6b3b229aa452 |
14 | 307b74c34bd5 |
15 | 165347594683 |
hex | b3238e9b737 |
12310331111223 has 4 divisors (see below), whose sum is σ = 16413774814968. Its totient is φ = 8206887407480.
The previous prime is 12310331111203. The next prime is 12310331111251. The reversal of 12310331111223 is 32211113301321.
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 12310331111223 - 234 = 12293151242039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12310331111193 and 12310331111202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12310331111203) 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, 2051721851868 + ... + 2051721851873.
It is an arithmetic number, because the mean of its divisors is an integer number (4103443703742).
Almost surely, 212310331111223 is an apocalyptic number.
12310331111223 is a deficient number, since it is larger than the sum of its proper divisors (4103443703745).
12310331111223 is an equidigital number, since it uses as much as digits as its factorization.
12310331111223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4103443703744.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 12310331111223 its reverse (32211113301321), we get a palindrome (44521444412544).
The spelling of 12310331111223 in words is "twelve trillion, three hundred ten billion, three hundred thirty-one million, one hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •