Base | Representation |
---|---|
bin | 110001001010000000… |
… | …1011101100111011001 |
3 | 101002110211201001022012 |
4 | 1202110001131213121 |
5 | 3212143013022041 |
6 | 120254513235305 |
7 | 10424640343352 |
oct | 1422401354731 |
9 | 332424631265 |
10 | 105562626521 |
11 | 40850394800 |
12 | 18560862b35 |
13 | 9c540aca21 |
14 | 5175b3ad29 |
15 | 2b2c77a3eb |
hex | 189405d9d9 |
105562626521 has 48 divisors (see below), whose sum is σ = 120732522624. Its totient is φ = 92179296000.
The previous prime is 105562626493. The next prime is 105562626523. The reversal of 105562626521 is 125626265501.
It is not a de Polignac number, because 105562626521 - 226 = 105495517657 is a prime.
It is a super-2 number, since 2×1055626265212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105562626523) 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 47 ways as a sum of consecutive naturals, for example, 57652076 + ... + 57653906.
It is an arithmetic number, because the mean of its divisors is an integer number (2515260888).
Almost surely, 2105562626521 is an apocalyptic number.
105562626521 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105562626521 is a deficient number, since it is larger than the sum of its proper divisors (15169896103).
105562626521 is a wasteful number, since it uses less digits than its factorization.
105562626521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2094 (or 2083 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 41.
The spelling of 105562626521 in words is "one hundred five billion, five hundred sixty-two million, six hundred twenty-six thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •