Base | Representation |
---|---|
bin | 110001001001100001… |
… | …0111001100111000001 |
3 | 101002102200211211011200 |
4 | 1202103002321213001 |
5 | 3212124313213423 |
6 | 120253125531413 |
7 | 10424351055636 |
oct | 1422302714701 |
9 | 332380754150 |
10 | 105546226113 |
11 | 40842102949 |
12 | 18557273b69 |
13 | 9c50889b43 |
14 | 51738ac18d |
15 | 2b2b0dad43 |
hex | 18930b99c1 |
105546226113 has 12 divisors (see below), whose sum is σ = 152461546068. Its totient is φ = 70361434080.
The previous prime is 105546226111. The next prime is 105546226147. The reversal of 105546226113 is 311622645501.
105546226113 is a `hidden beast` number, since 10 + 5 + 5 + 4 + 6 + 22 + 611 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 85133817729 + 20412408384 = 291777^2 + 142872^2 .
It is not a de Polignac number, because 105546226113 - 21 = 105546226111 is a prime.
It is a super-2 number, since 2×1055462261132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105546226111) 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, 35631 + ... + 460827.
It is an arithmetic number, because the mean of its divisors is an integer number (12705128839).
Almost surely, 2105546226113 is an apocalyptic number.
It is an amenable number.
105546226113 is a deficient number, since it is larger than the sum of its proper divisors (46915319955).
105546226113 is a wasteful number, since it uses less digits than its factorization.
105546226113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452784 (or 452781 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 105546226113 in words is "one hundred five billion, five hundred forty-six million, two hundred twenty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •