Base | Representation |
---|---|
bin | 10011010111111110100… |
… | …010001000101111110001 |
3 | 11201021121121200210220222 |
4 | 103113332202020233301 |
5 | 133303214301143144 |
6 | 2455351013342425 |
7 | 165122465643224 |
oct | 23277642105761 |
9 | 4637547623828 |
10 | 1331415256049 |
11 | 47371722501a |
12 | 196054337a15 |
13 | 98723750048 |
14 | 486259575bb |
15 | 24976e092ee |
hex | 135fe888bf1 |
1331415256049 has 2 divisors, whose sum is σ = 1331415256050. Its totient is φ = 1331415256048.
The previous prime is 1331415256019. The next prime is 1331415256063. The reversal of 1331415256049 is 9406525141331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 864468533824 + 466946722225 = 929768^2 + 683335^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331415256049 is a prime.
It is not a weakly prime, because it can be changed into another prime (1331415256019) 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, 665707628024 + 665707628025.
It is an arithmetic number, because the mean of its divisors is an integer number (665707628025).
Almost surely, 21331415256049 is an apocalyptic number.
It is an amenable number.
1331415256049 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331415256049 is an equidigital number, since it uses as much as digits as its factorization.
1331415256049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 44.
The spelling of 1331415256049 in words is "one trillion, three hundred thirty-one billion, four hundred fifteen million, two hundred fifty-six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •