Base | Representation |
---|---|
bin | 1101000110111001000100… |
… | …1100101100010010100101 |
3 | 1220000210000122010212120212 |
4 | 3101232101030230102211 |
5 | 3342111340113122131 |
6 | 50352445512305205 |
7 | 3015144031543355 |
oct | 321562114542245 |
9 | 56023018125525 |
10 | 14412051301541 |
11 | 4657131269223 |
12 | 174919a9a2205 |
13 | 80708724973a |
14 | 37b792da4b65 |
15 | 19ed557eca2b |
hex | d1b9132c4a5 |
14412051301541 has 2 divisors, whose sum is σ = 14412051301542. Its totient is φ = 14412051301540.
The previous prime is 14412051301513. The next prime is 14412051301561. The reversal of 14412051301541 is 14510315021441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13713105140641 + 698946160900 = 3703121^2 + 836030^2 .
It is a cyclic number.
It is not a de Polignac number, because 14412051301541 - 26 = 14412051301477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14412051301498 and 14412051301507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14412051301561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7206025650770 + 7206025650771.
It is an arithmetic number, because the mean of its divisors is an integer number (7206025650771).
Almost surely, 214412051301541 is an apocalyptic number.
It is an amenable number.
14412051301541 is a deficient number, since it is larger than the sum of its proper divisors (1).
14412051301541 is an equidigital number, since it uses as much as digits as its factorization.
14412051301541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 14412051301541 its reverse (14510315021441), we get a palindrome (28922366322982).
The spelling of 14412051301541 in words is "fourteen trillion, four hundred twelve billion, fifty-one million, three hundred one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •