Base | Representation |
---|---|
bin | 10100100001101000101… |
… | …010000000000110011101 |
3 | 11222211202112012212202122 |
4 | 110201220222000012131 |
5 | 141102203302122023 |
6 | 2555551015432325 |
7 | 203622426435422 |
oct | 24415052000635 |
9 | 4884675185678 |
10 | 1410505114013 |
11 | 4a42124019a6 |
12 | 1a94473856a5 |
13 | a301914a078 |
14 | 4c3a9895d49 |
15 | 26a555462c8 |
hex | 14868a8019d |
1410505114013 has 2 divisors, whose sum is σ = 1410505114014. Its totient is φ = 1410505114012.
The previous prime is 1410505114009. The next prime is 1410505114019. The reversal of 1410505114013 is 3104115050141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1243095663364 + 167409450649 = 1114942^2 + 409157^2 .
It is a cyclic number.
It is not a de Polignac number, because 1410505114013 - 22 = 1410505114009 is a prime.
It is a super-2 number, since 2×14105051140132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1410505114019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705252557006 + 705252557007.
It is an arithmetic number, because the mean of its divisors is an integer number (705252557007).
Almost surely, 21410505114013 is an apocalyptic number.
It is an amenable number.
1410505114013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1410505114013 is an equidigital number, since it uses as much as digits as its factorization.
1410505114013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 1410505114013 in words is "one trillion, four hundred ten billion, five hundred five million, one hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •