Base | Representation |
---|---|
bin | 1100101111101010101001… |
… | …0110110011100000011101 |
3 | 1211121122002221122221211112 |
4 | 3023322222112303200131 |
5 | 3314042202101040123 |
6 | 45445300302031405 |
7 | 2644260141545063 |
oct | 313725226634035 |
9 | 54548087587745 |
10 | 14013041424413 |
11 | 4512996623899 |
12 | 16a39a3278565 |
13 | 7a8568a9a925 |
14 | 3663404dc033 |
15 | 1947a0cd3d78 |
hex | cbeaa5b381d |
14013041424413 has 2 divisors, whose sum is σ = 14013041424414. Its totient is φ = 14013041424412.
The previous prime is 14013041424379. The next prime is 14013041424419. The reversal of 14013041424413 is 31442414031041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10337684661529 + 3675356762884 = 3215227^2 + 1917122^2 .
It is a cyclic number.
It is not a de Polignac number, because 14013041424413 - 222 = 14013037230109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14013041424413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14013041424419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7006520712206 + 7006520712207.
It is an arithmetic number, because the mean of its divisors is an integer number (7006520712207).
Almost surely, 214013041424413 is an apocalyptic number.
It is an amenable number.
14013041424413 is a deficient number, since it is larger than the sum of its proper divisors (1).
14013041424413 is an equidigital number, since it uses as much as digits as its factorization.
14013041424413 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 32.
Adding to 14013041424413 its reverse (31442414031041), we get a palindrome (45455455455454).
The spelling of 14013041424413 in words is "fourteen trillion, thirteen billion, forty-one million, four hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •