Base | Representation |
---|---|
bin | 1100110000111000101111… |
… | …0101011101011110100111 |
3 | 1211200122012212211110121102 |
4 | 3030032023311131132213 |
5 | 3314413120034002211 |
6 | 45503044343110315 |
7 | 2645631464330642 |
oct | 314161365353647 |
9 | 54618185743542 |
10 | 14034004203431 |
11 | 4520873563a53 |
12 | 16a7a7374239b |
13 | 7aa529a7ca94 |
14 | 36736c602a59 |
15 | 1950cb32ca3b |
hex | cc38bd5d7a7 |
14034004203431 has 2 divisors, whose sum is σ = 14034004203432. Its totient is φ = 14034004203430.
The previous prime is 14034004203389. The next prime is 14034004203451. The reversal of 14034004203431 is 13430240043041.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14034004203431 is a prime.
It is a super-2 number, since 2×140340042034312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 14034004203394 and 14034004203403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14034004203451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7017002101715 + 7017002101716.
It is an arithmetic number, because the mean of its divisors is an integer number (7017002101716).
Almost surely, 214034004203431 is an apocalyptic number.
14034004203431 is a deficient number, since it is larger than the sum of its proper divisors (1).
14034004203431 is an equidigital number, since it uses as much as digits as its factorization.
14034004203431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 14034004203431 its reverse (13430240043041), we get a palindrome (27464244246472).
The spelling of 14034004203431 in words is "fourteen trillion, thirty-four billion, four million, two hundred three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •