Base | Representation |
---|---|
bin | 1101000110111100110011… |
… | …1010101110000001101101 |
3 | 1220000212121110102202110211 |
4 | 3101233030322232001231 |
5 | 3342120413111114041 |
6 | 50353133143102421 |
7 | 3015210615666265 |
oct | 321571472560155 |
9 | 56025543382424 |
10 | 14413053223021 |
11 | 46575a5884702 |
12 | 174941a441a11 |
13 | 8071b69aa39b |
14 | 37b84a0927a5 |
15 | 19edb375d481 |
hex | d1bcceae06d |
14413053223021 has 2 divisors, whose sum is σ = 14413053223022. Its totient is φ = 14413053223020.
The previous prime is 14413053222973. The next prime is 14413053223027. The reversal of 14413053223021 is 12032235031441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11871739000521 + 2541314222500 = 3445539^2 + 1594150^2 .
It is a cyclic number.
It is not a de Polignac number, because 14413053223021 - 215 = 14413053190253 is a prime.
It is a super-2 number, since 2×144130532230212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14413053223027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7206526611510 + 7206526611511.
It is an arithmetic number, because the mean of its divisors is an integer number (7206526611511).
Almost surely, 214413053223021 is an apocalyptic number.
It is an amenable number.
14413053223021 is a deficient number, since it is larger than the sum of its proper divisors (1).
14413053223021 is an equidigital number, since it uses as much as digits as its factorization.
14413053223021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 14413053223021 its reverse (12032235031441), we get a palindrome (26445288254462).
The spelling of 14413053223021 in words is "fourteen trillion, four hundred thirteen billion, fifty-three million, two hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •