Base | Representation |
---|---|
bin | 1101000110110101001101… |
… | …0011111001110000001101 |
3 | 1220000200100021101220112112 |
4 | 3101231103103321300031 |
5 | 3342102223312114201 |
6 | 50352154502113405 |
7 | 3015106223265614 |
oct | 321552323716015 |
9 | 56020307356475 |
10 | 14411013004301 |
11 | 4656749168131 |
12 | 1748b4b11b865 |
13 | 806c500c0a84 |
14 | 37b6d512887b |
15 | 19ece45a40bb |
hex | d1b534f9c0d |
14411013004301 has 2 divisors, whose sum is σ = 14411013004302. Its totient is φ = 14411013004300.
The previous prime is 14411013004277. The next prime is 14411013004363. The reversal of 14411013004301 is 10340031011441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8679652515625 + 5731360488676 = 2946125^2 + 2394026^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14411013004301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14411013004391) 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, 7205506502150 + 7205506502151.
It is an arithmetic number, because the mean of its divisors is an integer number (7205506502151).
Almost surely, 214411013004301 is an apocalyptic number.
It is an amenable number.
14411013004301 is a deficient number, since it is larger than the sum of its proper divisors (1).
14411013004301 is an equidigital number, since it uses as much as digits as its factorization.
14411013004301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 14411013004301 its reverse (10340031011441), we get a palindrome (24751044015742).
The spelling of 14411013004301 in words is "fourteen trillion, four hundred eleven billion, thirteen million, four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •