Base | Representation |
---|---|
bin | 10111111111010011110000… |
… | …011010011000010010010001 |
3 | 111211120020102101001021121011 |
4 | 113333103300122120102101 |
5 | 102312100442141343001 |
6 | 1012220335210330521 |
7 | 31136346241661200 |
oct | 2777236032302221 |
9 | 454506371037534 |
10 | 105505610106001 |
11 | 30687750419876 |
12 | b9bb83b429a41 |
13 | 46b41a0710311 |
14 | 1c0a6da8d7237 |
15 | c2e69a3e2d51 |
hex | 5ff4f0698491 |
105505610106001 has 12 divisors (see below), whose sum is σ = 125724455250660. Its totient is φ = 88227687891840.
The previous prime is 105505610105989. The next prime is 105505610106011. The reversal of 105505610106001 is 100601016505501.
It can be written as a sum of positive squares in 2 ways, for example, as 17548391246400 + 87957218859601 = 4189080^2 + 9378551^2 .
It is not a de Polignac number, because 105505610106001 - 245 = 70321238017169 is a prime.
It is a super-2 number, since 2×1055056101060012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105505610106011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26258238436 + ... + 26258242453.
It is an arithmetic number, because the mean of its divisors is an integer number (10477037937555).
Almost surely, 2105505610106001 is an apocalyptic number.
It is an amenable number.
105505610106001 is a deficient number, since it is larger than the sum of its proper divisors (20218845144659).
105505610106001 is an equidigital number, since it uses as much as digits as its factorization.
105505610106001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52516480944 (or 52516480937 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 105505610106001 in words is "one hundred five trillion, five hundred five billion, six hundred ten million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •