Base | Representation |
---|---|
bin | 1100110000101001111010… |
… | …0011001110110010001101 |
3 | 1211200020221102220210002212 |
4 | 3030022132203032302031 |
5 | 3314331441421140321 |
6 | 45501145333000205 |
7 | 2645431024505156 |
oct | 314123643166215 |
9 | 54606842823085 |
10 | 14030023224461 |
11 | 451a110391592 |
12 | 16a7142483065 |
13 | 7aa04408b01a |
14 | 3670b1a0092d |
15 | 194e46ab355b |
hex | cc29e8cec8d |
14030023224461 has 2 divisors, whose sum is σ = 14030023224462. Its totient is φ = 14030023224460.
The previous prime is 14030023224383. The next prime is 14030023224463. The reversal of 14030023224461 is 16442232003041.
14030023224461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13001865756100 + 1028157468361 = 3605810^2 + 1013981^2 .
It is a cyclic number.
It is not a de Polignac number, because 14030023224461 - 218 = 14030022962317 is a prime.
Together with 14030023224463, 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 (14030023224463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7015011612230 + 7015011612231.
It is an arithmetic number, because the mean of its divisors is an integer number (7015011612231).
Almost surely, 214030023224461 is an apocalyptic number.
It is an amenable number.
14030023224461 is a deficient number, since it is larger than the sum of its proper divisors (1).
14030023224461 is an equidigital number, since it uses as much as digits as its factorization.
14030023224461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 32.
The spelling of 14030023224461 in words is "fourteen trillion, thirty billion, twenty-three million, two hundred twenty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •