Base | Representation |
---|---|
bin | 1011001100101011000000… |
… | …1011010101010000101111 |
3 | 1121121001021120220012211022 |
4 | 2303022300023111100233 |
5 | 3103211123444443043 |
6 | 42104112433244355 |
7 | 2410352031326153 |
oct | 263126013252057 |
9 | 47531246805738 |
10 | 12312332031023 |
11 | 3a176a34a4582 |
12 | 146a2671036bb |
13 | 6b40813b736b |
14 | 307cc488d063 |
15 | 165413089868 |
hex | b32b02d542f |
12312332031023 has 4 divisors (see below), whose sum is σ = 12960349506360. Its totient is φ = 11664314555688.
The previous prime is 12312332031019. The next prime is 12312332031047. The reversal of 12312332031023 is 32013023321321.
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 12312332031023 - 22 = 12312332031019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12312332030983 and 12312332031001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12312332039023) 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, 324008737640 + ... + 324008737677.
It is an arithmetic number, because the mean of its divisors is an integer number (3240087376590).
Almost surely, 212312332031023 is an apocalyptic number.
12312332031023 is a deficient number, since it is larger than the sum of its proper divisors (648017475337).
12312332031023 is an equidigital number, since it uses as much as digits as its factorization.
12312332031023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648017475336.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 12312332031023 its reverse (32013023321321), we get a palindrome (44325355352344).
The spelling of 12312332031023 in words is "twelve trillion, three hundred twelve billion, three hundred thirty-two million, thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •