Base | Representation |
---|---|
bin | 1100110001001111111100… |
… | …0011110001011101100001 |
3 | 1211201020021221002200021211 |
4 | 3030103333003301131201 |
5 | 3320013343432134213 |
6 | 45505554344550121 |
7 | 2646242021313661 |
oct | 314237703613541 |
9 | 54636257080254 |
10 | 14040232302433 |
11 | 452347a119a07 |
12 | 16a9111482341 |
13 | 7aacb019076c |
14 | 36779d82a1a1 |
15 | 195342ec053d |
hex | cc4ff0f1761 |
14040232302433 has 2 divisors, whose sum is σ = 14040232302434. Its totient is φ = 14040232302432.
The previous prime is 14040232302409. The next prime is 14040232302449. The reversal of 14040232302433 is 33420323204041.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11604535210849 + 2435697091584 = 3406543^2 + 1560672^2 .
It is a cyclic number.
It is not a de Polignac number, because 14040232302433 - 241 = 11841209046881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14040232302395 and 14040232302404.
It is not a weakly prime, because it can be changed into another prime (14040232302493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7020116151216 + 7020116151217.
It is an arithmetic number, because the mean of its divisors is an integer number (7020116151217).
Almost surely, 214040232302433 is an apocalyptic number.
It is an amenable number.
14040232302433 is a deficient number, since it is larger than the sum of its proper divisors (1).
14040232302433 is an equidigital number, since it uses as much as digits as its factorization.
14040232302433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 14040232302433 its reverse (33420323204041), we get a palindrome (47460555506474).
The spelling of 14040232302433 in words is "fourteen trillion, forty billion, two hundred thirty-two million, three hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •