Base | Representation |
---|---|
bin | 10100101000000001111… |
… | …010000011110111100101 |
3 | 12000111111000222110001021 |
4 | 110220001322003313211 |
5 | 141210234012030333 |
6 | 3003044211531141 |
7 | 204254531313604 |
oct | 24500172036745 |
9 | 5014430873037 |
10 | 1417371205093 |
11 | 4a7116104838 |
12 | 1aa8428b9ab1 |
13 | a387179925c |
14 | 4c85b715a3b |
15 | 26d0820d82d |
hex | 14a01e83de5 |
1417371205093 has 2 divisors, whose sum is σ = 1417371205094. Its totient is φ = 1417371205092.
The previous prime is 1417371205057. The next prime is 1417371205157. The reversal of 1417371205093 is 3905021737141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1301865026049 + 115506179044 = 1140993^2 + 339862^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1417371205093 is a prime.
It is a super-2 number, since 2×14173712050932 (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 (1417371205013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 708685602546 + 708685602547.
It is an arithmetic number, because the mean of its divisors is an integer number (708685602547).
Almost surely, 21417371205093 is an apocalyptic number.
It is an amenable number.
1417371205093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1417371205093 is an equidigital number, since it uses as much as digits as its factorization.
1417371205093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 158760, while the sum is 43.
The spelling of 1417371205093 in words is "one trillion, four hundred seventeen billion, three hundred seventy-one million, two hundred five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •