Base | Representation |
---|---|
bin | 11111001011100011100… |
… | …00001001100111000101 |
3 | 10210102100121000110110111 |
4 | 33211301300021213011 |
5 | 120023113424220024 |
6 | 2140101314153021 |
7 | 140255116555306 |
oct | 17456160114705 |
9 | 3712317013414 |
10 | 1071355304389 |
11 | 3833a5159237 |
12 | 153776882771 |
13 | 7a04a442a46 |
14 | 39bd50587ad |
15 | 1cd05d3da94 |
hex | f971c099c5 |
1071355304389 has 2 divisors, whose sum is σ = 1071355304390. Its totient is φ = 1071355304388.
The previous prime is 1071355304381. The next prime is 1071355304441. The reversal of 1071355304389 is 9834035531701.
1071355304389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 850471284100 + 220884020289 = 922210^2 + 469983^2 .
It is a cyclic number.
It is not a de Polignac number, because 1071355304389 - 23 = 1071355304381 is a prime.
It is a super-2 number, since 2×10713553043892 (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 (1071355304381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 535677652194 + 535677652195.
It is an arithmetic number, because the mean of its divisors is an integer number (535677652195).
Almost surely, 21071355304389 is an apocalyptic number.
It is an amenable number.
1071355304389 is a deficient number, since it is larger than the sum of its proper divisors (1).
1071355304389 is an equidigital number, since it uses as much as digits as its factorization.
1071355304389 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1360800, while the sum is 49.
The spelling of 1071355304389 in words is "one trillion, seventy-one billion, three hundred fifty-five million, three hundred four thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •