Base | Representation |
---|---|
bin | 10100100101011101011… |
… | …110110101011011001101 |
3 | 12000020100210012000121102 |
4 | 110211131132311123031 |
5 | 141134111311321441 |
6 | 3001510345312445 |
7 | 204126263512616 |
oct | 24453536653315 |
9 | 5006323160542 |
10 | 1414612604621 |
11 | 4a5a2aa33437 |
12 | 1aa1b2a95725 |
13 | a3522105898 |
14 | 4c6791cac0d |
15 | 26be5e5069b |
hex | 1495d7b56cd |
1414612604621 has 2 divisors, whose sum is σ = 1414612604622. Its totient is φ = 1414612604620.
The previous prime is 1414612604617. The next prime is 1414612604683. The reversal of 1414612604621 is 1264062164141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1385126563396 + 29486041225 = 1176914^2 + 171715^2 .
It is a cyclic number.
It is not a de Polignac number, because 1414612604621 - 22 = 1414612604617 is a prime.
It is a super-3 number, since 3×14146126046213 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1414612604921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 707306302310 + 707306302311.
It is an arithmetic number, because the mean of its divisors is an integer number (707306302311).
Almost surely, 21414612604621 is an apocalyptic number.
It is an amenable number.
1414612604621 is a deficient number, since it is larger than the sum of its proper divisors (1).
1414612604621 is an equidigital number, since it uses as much as digits as its factorization.
1414612604621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55296, while the sum is 38.
Adding to 1414612604621 its reverse (1264062164141), we get a palindrome (2678674768762).
The spelling of 1414612604621 in words is "one trillion, four hundred fourteen billion, six hundred twelve million, six hundred four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •