Base | Representation |
---|---|
bin | 11110101011011100010… |
… | …10100101010100010001 |
3 | 10201202212002211020110211 |
4 | 33111232022211110101 |
5 | 114232312001134234 |
6 | 2124130500124121 |
7 | 136104646556305 |
oct | 17255612452421 |
9 | 3652762736424 |
10 | 1054115255569 |
11 | 377058643402 |
12 | 150365096641 |
13 | 785307b251c |
14 | 3903b52dd05 |
15 | 1c64754b164 |
hex | f56e2a5511 |
1054115255569 has 2 divisors, whose sum is σ = 1054115255570. Its totient is φ = 1054115255568.
The previous prime is 1054115255519. The next prime is 1054115255573. The reversal of 1054115255569 is 9655525114501.
1054115255569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 649212113169 + 404903142400 = 805737^2 + 636320^2 .
It is a cyclic number.
It is not a de Polignac number, because 1054115255569 - 27 = 1054115255441 is a prime.
It is a super-2 number, since 2×10541152555692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1054115255509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527057627784 + 527057627785.
It is an arithmetic number, because the mean of its divisors is an integer number (527057627785).
Almost surely, 21054115255569 is an apocalyptic number.
It is an amenable number.
1054115255569 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054115255569 is an equidigital number, since it uses as much as digits as its factorization.
1054115255569 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1350000, while the sum is 49.
The spelling of 1054115255569 in words is "one trillion, fifty-four billion, one hundred fifteen million, two hundred fifty-five thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •