Base | Representation |
---|---|
bin | 11110100101101111100… |
… | …00101001110110101001 |
3 | 10201110221211102102000202 |
4 | 33102313300221312221 |
5 | 114210030040130342 |
6 | 2122503100241545 |
7 | 135636060064256 |
oct | 17226760516651 |
9 | 3643854372022 |
10 | 1051055005097 |
11 | 375828170989 |
12 | 14b8502402b5 |
13 | 78163794026 |
14 | 38c2ad2242d |
15 | 1c518a55332 |
hex | f4b7c29da9 |
1051055005097 has 2 divisors, whose sum is σ = 1051055005098. Its totient is φ = 1051055005096.
The previous prime is 1051055005093. The next prime is 1051055005159. The reversal of 1051055005097 is 7905005501501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 894166924816 + 156888080281 = 945604^2 + 396091^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051055005097 - 22 = 1051055005093 is a prime.
It is a super-2 number, since 2×10510550050972 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1051055005097.
It is not a weakly prime, because it can be changed into another prime (1051055005093) 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, 525527502548 + 525527502549.
It is an arithmetic number, because the mean of its divisors is an integer number (525527502549).
Almost surely, 21051055005097 is an apocalyptic number.
It is an amenable number.
1051055005097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051055005097 is an equidigital number, since it uses as much as digits as its factorization.
1051055005097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39375, while the sum is 38.
The spelling of 1051055005097 in words is "one trillion, fifty-one billion, fifty-five million, five thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •