Base | Representation |
---|---|
bin | 1100101011111101010011… |
… | …1111000010110000010001 |
3 | 1211101112122221100021011101 |
4 | 3022333110333002300101 |
5 | 3312021213004400012 |
6 | 45400122410144401 |
7 | 2636543311353532 |
oct | 312772477026021 |
9 | 54345587307141 |
10 | 13949332106257 |
11 | 4498973352139 |
12 | 1693583122101 |
13 | 7a2554a06732 |
14 | 363219160689 |
15 | 192cc2ac8d57 |
hex | cafd4fc2c11 |
13949332106257 has 2 divisors, whose sum is σ = 13949332106258. Its totient is φ = 13949332106256.
The previous prime is 13949332106249. The next prime is 13949332106263. The reversal of 13949332106257 is 75260123394931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10815047813376 + 3134284292881 = 3288624^2 + 1770391^2 .
It is a cyclic number.
It is not a de Polignac number, because 13949332106257 - 23 = 13949332106249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13949332106198 and 13949332106207.
It is not a weakly prime, because it can be changed into another prime (13949332116257) 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, 6974666053128 + 6974666053129.
It is an arithmetic number, because the mean of its divisors is an integer number (6974666053129).
Almost surely, 213949332106257 is an apocalyptic number.
It is an amenable number.
13949332106257 is a deficient number, since it is larger than the sum of its proper divisors (1).
13949332106257 is an equidigital number, since it uses as much as digits as its factorization.
13949332106257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7348320, while the sum is 55.
The spelling of 13949332106257 in words is "thirteen trillion, nine hundred forty-nine billion, three hundred thirty-two million, one hundred six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •