Base | Representation |
---|---|
bin | 110001001001101011… |
… | …0010101101111001001 |
3 | 101002110001102201111100 |
4 | 1202103112111233021 |
5 | 3212132114301212 |
6 | 120253431052013 |
7 | 10424442301626 |
oct | 1422326255711 |
9 | 332401381440 |
10 | 105551322057 |
11 | 40844a73575 |
12 | 18558b11009 |
13 | 9c519524ac |
14 | 517443734d |
15 | 2b2b795bdc |
hex | 1893595bc9 |
105551322057 has 12 divisors (see below), whose sum is σ = 152466312960. Its totient is φ = 70366028568.
The previous prime is 105551322047. The next prime is 105551322119. The reversal of 105551322057 is 750223155501.
105551322057 is a `hidden beast` number, since 1 + 0 + 5 + 551 + 32 + 20 + 57 = 666.
It is not a de Polignac number, because 105551322057 - 215 = 105551289289 is a prime.
It is a super-2 number, since 2×1055513220572 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105551322007) 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 in 11 ways as a sum of consecutive naturals, for example, 452944 + ... + 645182.
It is an arithmetic number, because the mean of its divisors is an integer number (12705526080).
Almost surely, 2105551322057 is an apocalyptic number.
It is an amenable number.
105551322057 is a deficient number, since it is larger than the sum of its proper divisors (46914990903).
105551322057 is a wasteful number, since it uses less digits than its factorization.
105551322057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253252 (or 253249 counting only the distinct ones).
The product of its (nonzero) digits is 52500, while the sum is 36.
Adding to 105551322057 its reverse (750223155501), we get a palindrome (855774477558).
The spelling of 105551322057 in words is "one hundred five billion, five hundred fifty-one million, three hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •