Base | Representation |
---|---|
bin | 11011000100010010… |
… | …00110010010101001 |
3 | 1101111201111100120111 |
4 | 31202021012102221 |
5 | 214230023012441 |
6 | 10401535254321 |
7 | 1023050215312 |
oct | 154211062251 |
9 | 41451440514 |
10 | 14531454121 |
11 | 6187699618 |
12 | 299667a3a1 |
13 | 14a7757a82 |
14 | 9bbcd9609 |
15 | 5a0b11081 |
hex | 3622464a9 |
14531454121 has 2 divisors, whose sum is σ = 14531454122. Its totient is φ = 14531454120.
The previous prime is 14531454109. The next prime is 14531454127. The reversal of 14531454121 is 12145413541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14248003225 + 283450896 = 119365^2 + 16836^2 .
It is an emirp because it is prime and its reverse (12145413541) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14531454121 is a prime.
It is a super-2 number, since 2×145314541212 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14531454127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7265727060 + 7265727061.
It is an arithmetic number, because the mean of its divisors is an integer number (7265727061).
Almost surely, 214531454121 is an apocalyptic number.
It is an amenable number.
14531454121 is a deficient number, since it is larger than the sum of its proper divisors (1).
14531454121 is an equidigital number, since it uses as much as digits as its factorization.
14531454121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9600, while the sum is 31.
Adding to 14531454121 its reverse (12145413541), we get a palindrome (26676867662).
It can be divided in two parts, 14 and 531454121, that added together give a palindrome (531454135).
The spelling of 14531454121 in words is "fourteen billion, five hundred thirty-one million, four hundred fifty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •