Base | Representation |
---|---|
bin | 10010101111101101000… |
… | …000001101010000101101 |
3 | 11120010222212220011202011 |
4 | 102233231000031100231 |
5 | 132101133344213023 |
6 | 2423440001201221 |
7 | 162032042611612 |
oct | 22575500152055 |
9 | 4503885804664 |
10 | 1288171476013 |
11 | 457346241034 |
12 | 1897a6030211 |
13 | 94621640a16 |
14 | 464c2646509 |
15 | 2379577750d |
hex | 12bed00d42d |
1288171476013 has 2 divisors, whose sum is σ = 1288171476014. Its totient is φ = 1288171476012.
The previous prime is 1288171475993. The next prime is 1288171476037. The reversal of 1288171476013 is 3106741718821.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 764578857604 + 523592618409 = 874402^2 + 723597^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1288171476013 is a prime.
It is a super-2 number, since 2×12881714760132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1288171476043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 644085738006 + 644085738007.
It is an arithmetic number, because the mean of its divisors is an integer number (644085738007).
Almost surely, 21288171476013 is an apocalyptic number.
It is an amenable number.
1288171476013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1288171476013 is an equidigital number, since it uses as much as digits as its factorization.
1288171476013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 451584, while the sum is 49.
The spelling of 1288171476013 in words is "one trillion, two hundred eighty-eight billion, one hundred seventy-one million, four hundred seventy-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •