Base | Representation |
---|---|
bin | 1101000111011110111111… |
… | …1010100000011100011101 |
3 | 1220001202022000201210122222 |
4 | 3101313233322200130131 |
5 | 3342243211424221131 |
6 | 50401251531515125 |
7 | 3015654211622063 |
oct | 321675772403435 |
9 | 56052260653588 |
10 | 14422230304541 |
11 | 46604850248a4 |
12 | 174b15b8b8aa5 |
13 | 80801a04c037 |
14 | 37c07ac02033 |
15 | 1a024e26887b |
hex | d1defea071d |
14422230304541 has 2 divisors, whose sum is σ = 14422230304542. Its totient is φ = 14422230304540.
The previous prime is 14422230304529. The next prime is 14422230304543. The reversal of 14422230304541 is 14540303222441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9390418655641 + 5031811648900 = 3064379^2 + 2243170^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14422230304541 is a prime.
Together with 14422230304543, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14422230304543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7211115152270 + 7211115152271.
It is an arithmetic number, because the mean of its divisors is an integer number (7211115152271).
Almost surely, 214422230304541 is an apocalyptic number.
It is an amenable number.
14422230304541 is a deficient number, since it is larger than the sum of its proper divisors (1).
14422230304541 is an equidigital number, since it uses as much as digits as its factorization.
14422230304541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 92160, while the sum is 35.
Adding to 14422230304541 its reverse (14540303222441), we get a palindrome (28962533526982).
The spelling of 14422230304541 in words is "fourteen trillion, four hundred twenty-two billion, two hundred thirty million, three hundred four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •