Base | Representation |
---|---|
bin | 110001001001100001… |
… | …1111010000000000001 |
3 | 101002102201100012221222 |
4 | 1202103003322000001 |
5 | 3212124400133412 |
6 | 120253135324425 |
7 | 10424353234604 |
oct | 1422303720001 |
9 | 332381305858 |
10 | 105546489857 |
11 | 40842273016 |
12 | 18557380715 |
13 | 9c5094cbc3 |
14 | 517393a33b |
15 | 2b2b13e072 |
hex | 18930fa001 |
105546489857 has 12 divisors (see below), whose sum is σ = 109335947136. Its totient is φ = 101884189680.
The previous prime is 105546489823. The next prime is 105546489949. The reversal of 105546489857 is 758984645501.
It is not a de Polignac number, because 105546489857 - 224 = 105529712641 is a prime.
It is a super-2 number, since 2×1055464898572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105546489857.
It is not an unprimeable number, because it can be changed into a prime (105546489817) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4690808 + ... + 4713254.
It is an arithmetic number, because the mean of its divisors is an integer number (9111328928).
Almost surely, 2105546489857 is an apocalyptic number.
It is an amenable number.
105546489857 is a deficient number, since it is larger than the sum of its proper divisors (3789457279).
105546489857 is an equidigital number, since it uses as much as digits as its factorization.
105546489857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28096 (or 28067 counting only the distinct ones).
The product of its (nonzero) digits is 48384000, while the sum is 62.
The spelling of 105546489857 in words is "one hundred five billion, five hundred forty-six million, four hundred eighty-nine thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •