Base | Representation |
---|---|
bin | 10111111111111111111001… |
… | …101111111110100101001111 |
3 | 111211201202202211221122222221 |
4 | 113333333321233332211033 |
5 | 102313340031404344322 |
6 | 1012254214540520211 |
7 | 31142645010234463 |
oct | 2777777157764517 |
9 | 454652684848887 |
10 | 105553011403087 |
11 | 306a58651a2966 |
12 | ba08a69b50067 |
13 | 46b87b5c725c1 |
14 | 1c0cb160424a3 |
15 | c30a21a619c7 |
hex | 5ffff9bfe94f |
105553011403087 has 2 divisors, whose sum is σ = 105553011403088. Its totient is φ = 105553011403086.
The previous prime is 105553011403069. The next prime is 105553011403153. The reversal of 105553011403087 is 780304110355501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105553011403087 - 27 = 105553011402959 is a prime.
It is a super-2 number, since 2×1055530114030872 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105553012403087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (37) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52776505701543 + 52776505701544.
It is an arithmetic number, because the mean of its divisors is an integer number (52776505701544).
Almost surely, 2105553011403087 is an apocalyptic number.
105553011403087 is a deficient number, since it is larger than the sum of its proper divisors (1).
105553011403087 is an equidigital number, since it uses as much as digits as its factorization.
105553011403087 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252000, while the sum is 43.
Adding to 105553011403087 its reverse (780304110355501), we get a palindrome (885857121758588).
The spelling of 105553011403087 in words is "one hundred five trillion, five hundred fifty-three billion, eleven million, four hundred three thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •