Base | Representation |
---|---|
bin | 1100001111010011010111… |
… | …0000100111111010001001 |
3 | 1202122110221212111112111111 |
4 | 3003310311300213322021 |
5 | 3230440001311232233 |
6 | 44342024251330321 |
7 | 2556144600511126 |
oct | 303646560477211 |
9 | 52573855445444 |
10 | 13457034477193 |
11 | 4319107157a5a |
12 | 16140917509a1 |
13 | 767cba5511c8 |
14 | 347476c8b74d |
15 | 1850ad29eacd |
hex | c3d35c27e89 |
13457034477193 has 2 divisors, whose sum is σ = 13457034477194. Its totient is φ = 13457034477192.
The previous prime is 13457034477163. The next prime is 13457034477281. The reversal of 13457034477193 is 39177443075431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7333626876489 + 6123407600704 = 2708067^2 + 2474552^2 .
It is a cyclic number.
It is not a de Polignac number, because 13457034477193 - 229 = 13456497606281 is a prime.
It is a super-2 number, since 2×134570344771932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13457034477143) 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, 6728517238596 + 6728517238597.
It is an arithmetic number, because the mean of its divisors is an integer number (6728517238597).
Almost surely, 213457034477193 is an apocalyptic number.
It is an amenable number.
13457034477193 is a deficient number, since it is larger than the sum of its proper divisors (1).
13457034477193 is an equidigital number, since it uses as much as digits as its factorization.
13457034477193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26671680, while the sum is 58.
The spelling of 13457034477193 in words is "thirteen trillion, four hundred fifty-seven billion, thirty-four million, four hundred seventy-seven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •