Base | Representation |
---|---|
bin | 10011001001110011101… |
… | …011000011000100110111 |
3 | 11122211100021202002222011 |
4 | 103021303223003010313 |
5 | 133031034332012312 |
6 | 2444353151545051 |
7 | 164043451664212 |
oct | 23116353030467 |
9 | 4584307662864 |
10 | 1316200657207 |
11 | 468219a59797 |
12 | 193108b2b187 |
13 | 9716a607b37 |
14 | 479c1030779 |
15 | 24386354da7 |
hex | 13273ac3137 |
1316200657207 has 4 divisors (see below), whose sum is σ = 1393624225296. Its totient is φ = 1238777089120.
The previous prime is 1316200657201. The next prime is 1316200657223. The reversal of 1316200657207 is 7027560026131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1316200657207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1316200657207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1316200657201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38711784019 + ... + 38711784052.
It is an arithmetic number, because the mean of its divisors is an integer number (348406056324).
Almost surely, 21316200657207 is an apocalyptic number.
1316200657207 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1316200657207 is a deficient number, since it is larger than the sum of its proper divisors (77423568089).
1316200657207 is an equidigital number, since it uses as much as digits as its factorization.
1316200657207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77423568088.
The product of its (nonzero) digits is 105840, while the sum is 40.
The spelling of 1316200657207 in words is "one trillion, three hundred sixteen billion, two hundred million, six hundred fifty-seven thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •