Base | Representation |
---|---|
bin | 1100100010011010110011… |
… | …1010010110111100010101 |
3 | 1210210212122210012010122002 |
4 | 3020212230322112330111 |
5 | 3301330100431013331 |
6 | 45152540534045045 |
7 | 2621652220253162 |
oct | 310465472267425 |
9 | 53725583163562 |
10 | 13785451032341 |
11 | 44354167a377a |
12 | 16678677a9785 |
13 | 78cc68687591 |
14 | 359310013069 |
15 | 18d8d05589cb |
hex | c89ace96f15 |
13785451032341 has 2 divisors, whose sum is σ = 13785451032342. Its totient is φ = 13785451032340.
The previous prime is 13785451032313. The next prime is 13785451032343. The reversal of 13785451032341 is 14323015458731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12550121038225 + 1235329994116 = 3542615^2 + 1111454^2 .
It is a cyclic number.
It is not a de Polignac number, because 13785451032341 - 218 = 13785450770197 is a prime.
Together with 13785451032343, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13785451032343) 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, 6892725516170 + 6892725516171.
It is an arithmetic number, because the mean of its divisors is an integer number (6892725516171).
Almost surely, 213785451032341 is an apocalyptic number.
It is an amenable number.
13785451032341 is a deficient number, since it is larger than the sum of its proper divisors (1).
13785451032341 is an equidigital number, since it uses as much as digits as its factorization.
13785451032341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1209600, while the sum is 47.
The spelling of 13785451032341 in words is "thirteen trillion, seven hundred eighty-five billion, four hundred fifty-one million, thirty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •