Base | Representation |
---|---|
bin | 110001001000011100… |
… | …0101101100110011111 |
3 | 101002100011200101201212 |
4 | 1202100320231212133 |
5 | 3212041030013210 |
6 | 120245353255035 |
7 | 10423431132344 |
oct | 1422070554637 |
9 | 332304611655 |
10 | 105510001055 |
11 | 40823710488 |
12 | 1854710447b |
13 | 9c462155b4 |
14 | 516cb5c7cb |
15 | 2b27d32805 |
hex | 1890e2d99f |
105510001055 has 16 divisors (see below), whose sum is σ = 127086865920. Its totient is φ = 84091975968.
The previous prime is 105510001043. The next prime is 105510001057. The reversal of 105510001055 is 550100015501.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 105510001055 - 210 = 105510000031 is a prime.
It is a super-2 number, since 2×1055100010552 (a number of 23 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 105510001055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105510001057) 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 15 ways as a sum of consecutive naturals, for example, 1522694 + ... + 1590476.
It is an arithmetic number, because the mean of its divisors is an integer number (7942929120).
Almost surely, 2105510001055 is an apocalyptic number.
105510001055 is a deficient number, since it is larger than the sum of its proper divisors (21576864865).
105510001055 is an equidigital number, since it uses as much as digits as its factorization.
105510001055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68950.
The product of its (nonzero) digits is 625, while the sum is 23.
Adding to 105510001055 its reverse (550100015501), we get a palindrome (655610016556).
The spelling of 105510001055 in words is "one hundred five billion, five hundred ten million, one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •