Base | Representation |
---|---|
bin | 1100110101100010101111… |
… | …1110111001000010111101 |
3 | 1211222021200221212102020211 |
4 | 3031120223332321002331 |
5 | 3322220433103112113 |
6 | 50003514324112421 |
7 | 2654463042203626 |
oct | 315305376710275 |
9 | 54867627772224 |
10 | 14114000441533 |
11 | 4551794330723 |
12 | 16bb47a235711 |
13 | 7b4c38198505 |
14 | 36b19aa7ca4d |
15 | 19720e306b3d |
hex | cd62bfb90bd |
14114000441533 has 2 divisors, whose sum is σ = 14114000441534. Its totient is φ = 14114000441532.
The previous prime is 14114000441459. The next prime is 14114000441539. The reversal of 14114000441533 is 33514400041141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7951824730404 + 6162175711129 = 2819898^2 + 2482373^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14114000441533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14114000441495 and 14114000441504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14114000441539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7057000220766 + 7057000220767.
It is an arithmetic number, because the mean of its divisors is an integer number (7057000220767).
Almost surely, 214114000441533 is an apocalyptic number.
It is an amenable number.
14114000441533 is a deficient number, since it is larger than the sum of its proper divisors (1).
14114000441533 is an equidigital number, since it uses as much as digits as its factorization.
14114000441533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 14114000441533 its reverse (33514400041141), we get a palindrome (47628400482674).
The spelling of 14114000441533 in words is "fourteen trillion, one hundred fourteen billion, four hundred forty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •