Base | Representation |
---|---|
bin | 10011000111110110100… |
… | …001100100010000101101 |
3 | 11122121220221220110202210 |
4 | 103013312201210100231 |
5 | 133012234330112233 |
6 | 2443404545241033 |
7 | 163640435240100 |
oct | 23076641442055 |
9 | 4577827813683 |
10 | 1314101019693 |
11 | 467341848a80 |
12 | 192821933179 |
13 | 96bc4615c87 |
14 | 4786223a737 |
15 | 242b1d60163 |
hex | 131f686442d |
1314101019693 has 24 divisors (see below), whose sum is σ = 2223488184480. Its totient is φ = 682649879520.
The previous prime is 1314101019691. The next prime is 1314101019709. The reversal of 1314101019693 is 3969101014131.
It is not a de Polignac number, because 1314101019693 - 21 = 1314101019691 is a prime.
It is a super-2 number, since 2×13141010196932 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314101019691) 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 in 23 ways as a sum of consecutive naturals, for example, 406337598 + ... + 406340831.
It is an arithmetic number, because the mean of its divisors is an integer number (92645341020).
Almost surely, 21314101019693 is an apocalyptic number.
It is an amenable number.
1314101019693 is a deficient number, since it is larger than the sum of its proper divisors (909387164787).
1314101019693 is a wasteful number, since it uses less digits than its factorization.
1314101019693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 812678457 (or 812678450 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 39.
The spelling of 1314101019693 in words is "one trillion, three hundred fourteen billion, one hundred one million, nineteen thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •