Base | Representation |
---|---|
bin | 10111111101000001100110… |
… | …001001001101000100100101 |
3 | 111211000020100001102100011220 |
4 | 113331001212021031010211 |
5 | 102302013034402301112 |
6 | 1012020302300050553 |
7 | 31122122201025234 |
oct | 2775014611150445 |
9 | 454006301370156 |
10 | 105348671525157 |
11 | 30627136707195 |
12 | b995340b33a59 |
13 | 46a244c7b0b28 |
14 | 1c02c8d816b1b |
15 | c2a5625cc98c |
hex | 5fd06624d125 |
105348671525157 has 32 divisors (see below), whose sum is σ = 145275757756416. Its totient is φ = 67835879592000.
The previous prime is 105348671525147. The next prime is 105348671525161. The reversal of 105348671525157 is 751525176843501.
It is not a de Polignac number, because 105348671525157 - 230 = 105347597783333 is a prime.
It is a super-2 number, since 2×1053486715251572 (a number of 29 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 105348671525157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105348671525107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 103912498 + ... + 104921420.
It is an arithmetic number, because the mean of its divisors is an integer number (4539867429888).
Almost surely, 2105348671525157 is an apocalyptic number.
It is an amenable number.
105348671525157 is a deficient number, since it is larger than the sum of its proper divisors (39927086231259).
105348671525157 is a wasteful number, since it uses less digits than its factorization.
105348671525157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1011121.
The product of its (nonzero) digits is 35280000, while the sum is 60.
The spelling of 105348671525157 in words is "one hundred five trillion, three hundred forty-eight billion, six hundred seventy-one million, five hundred twenty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •