Base | Representation |
---|---|
bin | 1011010100010001111100… |
… | …0100000000011001101111 |
3 | 1122001112122221122011100011 |
4 | 2311010133010000121233 |
5 | 3112331322044303211 |
6 | 42244130532514051 |
7 | 2422660110536665 |
oct | 265043704003157 |
9 | 48045587564304 |
10 | 12443041400431 |
11 | 3a68078532414 |
12 | 148b66547b927 |
13 | 6c34b222bab5 |
14 | 310364250c35 |
15 | 168a13321921 |
hex | b511f10066f |
12443041400431 has 2 divisors, whose sum is σ = 12443041400432. Its totient is φ = 12443041400430.
The previous prime is 12443041400429. The next prime is 12443041400443. The reversal of 12443041400431 is 13400414034421.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12443041400431 - 21 = 12443041400429 is a prime.
It is a super-2 number, since 2×124430414004312 (a number of 27 digits) contains 22 as substring.
Together with 12443041400429, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12443041400393 and 12443041400402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12443041401431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6221520700215 + 6221520700216.
It is an arithmetic number, because the mean of its divisors is an integer number (6221520700216).
Almost surely, 212443041400431 is an apocalyptic number.
12443041400431 is a deficient number, since it is larger than the sum of its proper divisors (1).
12443041400431 is an equidigital number, since it uses as much as digits as its factorization.
12443041400431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 12443041400431 its reverse (13400414034421), we get a palindrome (25843455434852).
The spelling of 12443041400431 in words is "twelve trillion, four hundred forty-three billion, forty-one million, four hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •