Base | Representation |
---|---|
bin | 10011101001110011001… |
… | …101100001101110000011 |
3 | 11210010000100002111102022 |
4 | 103221303031201232003 |
5 | 134111412440004041 |
6 | 2512234010312055 |
7 | 166400645112353 |
oct | 23516315415603 |
9 | 4703010074368 |
10 | 1350552656771 |
11 | 48084784747a |
12 | 1998b542862b |
13 | 9a4834c79b6 |
14 | 4951d45ab63 |
15 | 251e708524b |
hex | 13a73361b83 |
1350552656771 has 2 divisors, whose sum is σ = 1350552656772. Its totient is φ = 1350552656770.
The previous prime is 1350552656753. The next prime is 1350552656773. The reversal of 1350552656771 is 1776562550531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1350552656771 - 222 = 1350548462467 is a prime.
It is a super-2 number, since 2×13505526567712 (a number of 25 digits) contains 22 as substring.
Together with 1350552656773, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1350552656773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675276328385 + 675276328386.
It is an arithmetic number, because the mean of its divisors is an integer number (675276328386).
Almost surely, 21350552656771 is an apocalyptic number.
1350552656771 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350552656771 is an equidigital number, since it uses as much as digits as its factorization.
1350552656771 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6615000, while the sum is 53.
The spelling of 1350552656771 in words is "one trillion, three hundred fifty billion, five hundred fifty-two million, six hundred fifty-six thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •