Base | Representation |
---|---|
bin | 110001001001001010… |
… | …1110100111100101000 |
3 | 101002101212121112020201 |
4 | 1202102111310330220 |
5 | 3212113302114121 |
6 | 120252024401544 |
7 | 10424145455122 |
oct | 1422225647450 |
9 | 332355545221 |
10 | 105534410536 |
11 | 40836472705 |
12 | 185533162b4 |
13 | 9c4b2b0a89 |
14 | 51720b4212 |
15 | 2b2a054e91 |
hex | 1892574f28 |
105534410536 has 16 divisors (see below), whose sum is σ = 206480368800. Its totient is φ = 50472978864.
The previous prime is 105534410507. The next prime is 105534410537. The reversal of 105534410536 is 635014435501.
It is a super-2 number, since 2×1055344105362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105534410495 and 105534410504.
It is not an unprimeable number, because it can be changed into a prime (105534410537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 286778106 + ... + 286778473.
It is an arithmetic number, because the mean of its divisors is an integer number (12905023050).
Almost surely, 2105534410536 is an apocalyptic number.
It is an amenable number.
105534410536 is a deficient number, since it is larger than the sum of its proper divisors (100945958264).
105534410536 is a wasteful number, since it uses less digits than its factorization.
105534410536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573556608 (or 573556604 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 105534410536 in words is "one hundred five billion, five hundred thirty-four million, four hundred ten thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •