Base | Representation |
---|---|
bin | 1100110001011010010011… |
… | …0100001011100111101011 |
3 | 1211201111110201220121001002 |
4 | 3030112210310023213223 |
5 | 3320040042341430011 |
6 | 45511134325545215 |
7 | 2646400646660441 |
oct | 314264464134753 |
9 | 54644421817032 |
10 | 14043013233131 |
11 | 4524676962343 |
12 | 16a976887520b |
13 | 7ab33437209c |
14 | 367984cc8b91 |
15 | 1954571dec3b |
hex | cc5a4d0b9eb |
14043013233131 has 2 divisors, whose sum is σ = 14043013233132. Its totient is φ = 14043013233130.
The previous prime is 14043013233127. The next prime is 14043013233229. The reversal of 14043013233131 is 13133231034041.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14043013233131 - 22 = 14043013233127 is a prime.
It is a super-2 number, since 2×140430132331312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14043013233094 and 14043013233103.
It is not a weakly prime, because it can be changed into another prime (14043013233101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7021506616565 + 7021506616566.
It is an arithmetic number, because the mean of its divisors is an integer number (7021506616566).
Almost surely, 214043013233131 is an apocalyptic number.
14043013233131 is a deficient number, since it is larger than the sum of its proper divisors (1).
14043013233131 is an equidigital number, since it uses as much as digits as its factorization.
14043013233131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 14043013233131 its reverse (13133231034041), we get a palindrome (27176244267172).
The spelling of 14043013233131 in words is "fourteen trillion, forty-three billion, thirteen million, two hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •