Base | Representation |
---|---|
bin | 1011001100101010101001… |
… | …0101100010010000111111 |
3 | 1121121001000202111212202012 |
4 | 2303022222111202100333 |
5 | 3103210423403324211 |
6 | 42104055013121435 |
7 | 2410346431412141 |
oct | 263125225422077 |
9 | 47531022455665 |
10 | 12312234042431 |
11 | 3a17653157274 |
12 | 146a23a32927b |
13 | 6b4066cc924b |
14 | 307cb5862c91 |
15 | 165409680d8b |
hex | b32aa56243f |
12312234042431 has 2 divisors, whose sum is σ = 12312234042432. Its totient is φ = 12312234042430.
The previous prime is 12312234042403. The next prime is 12312234042461. The reversal of 12312234042431 is 13424043221321.
It is a happy number.
12312234042431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12312234042431 - 210 = 12312234041407 is a prime.
It is a super-2 number, since 2×123122340424312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12312234042401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6156117021215 + 6156117021216.
It is an arithmetic number, because the mean of its divisors is an integer number (6156117021216).
Almost surely, 212312234042431 is an apocalyptic number.
12312234042431 is a deficient number, since it is larger than the sum of its proper divisors (1).
12312234042431 is an equidigital number, since it uses as much as digits as its factorization.
12312234042431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 12312234042431 its reverse (13424043221321), we get a palindrome (25736277263752).
The spelling of 12312234042431 in words is "twelve trillion, three hundred twelve billion, two hundred thirty-four million, forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •