Base | Representation |
---|---|
bin | 10010111100110001001… |
… | …011001101100011101111 |
3 | 11121111012120020210102022 |
4 | 102330301023031203233 |
5 | 132313401212112031 |
6 | 2434120015420355 |
7 | 163036506222212 |
oct | 22746113154357 |
9 | 4544176223368 |
10 | 1302200113391 |
11 | 462295019a21 |
12 | 1904602246bb |
13 | 95a48b68598 |
14 | 47053855779 |
15 | 23d1716597b |
hex | 12f312cd8ef |
1302200113391 has 2 divisors, whose sum is σ = 1302200113392. Its totient is φ = 1302200113390.
The previous prime is 1302200113363. The next prime is 1302200113397. The reversal of 1302200113391 is 1933110022031.
It is a strong prime.
It is an emirp because it is prime and its reverse (1933110022031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1302200113391 - 218 = 1302199851247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1302200113391.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1302200113397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651100056695 + 651100056696.
It is an arithmetic number, because the mean of its divisors is an integer number (651100056696).
Almost surely, 21302200113391 is an apocalyptic number.
1302200113391 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302200113391 is an equidigital number, since it uses as much as digits as its factorization.
1302200113391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 1302200113391 in words is "one trillion, three hundred two billion, two hundred million, one hundred thirteen thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •