Base | Representation |
---|---|
bin | 11011000011011011… |
… | …10111100110001001 |
3 | 1101111020001200222011 |
4 | 31201231313212021 |
5 | 214221211103131 |
6 | 10401122255521 |
7 | 1022632435504 |
oct | 154155674611 |
9 | 41436050864 |
10 | 14524316041 |
11 | 6183663684 |
12 | 29941b75a1 |
13 | 14a6128a61 |
14 | 9bad9c13b |
15 | 5a01a10b1 |
hex | 361b77989 |
14524316041 has 2 divisors, whose sum is σ = 14524316042. Its totient is φ = 14524316040.
The previous prime is 14524316033. The next prime is 14524316101. The reversal of 14524316041 is 14061342541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13646912400 + 877403641 = 116820^2 + 29621^2 .
It is an emirp because it is prime and its reverse (14061342541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14524316041 - 23 = 14524316033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14524315994 and 14524316012.
It is not a weakly prime, because it can be changed into another prime (14524316021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7262158020 + 7262158021.
It is an arithmetic number, because the mean of its divisors is an integer number (7262158021).
Almost surely, 214524316041 is an apocalyptic number.
It is an amenable number.
14524316041 is a deficient number, since it is larger than the sum of its proper divisors (1).
14524316041 is an equidigital number, since it uses as much as digits as its factorization.
14524316041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 14524316041 its reverse (14061342541), we get a palindrome (28585658582).
The spelling of 14524316041 in words is "fourteen billion, five hundred twenty-four million, three hundred sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •