Base | Representation |
---|---|
bin | 110001001100010010… |
… | …1111011100100010010 |
3 | 101002200011222020000202 |
4 | 1202120211323210102 |
5 | 3212322124422000 |
6 | 120310252415202 |
7 | 10426561123346 |
oct | 1423045734422 |
9 | 332604866022 |
10 | 105639295250 |
11 | 4088a6a0095 |
12 | 18582477502 |
13 | 9c66c44a38 |
14 | 5181db7626 |
15 | 2b34371dd5 |
hex | 189897b912 |
105639295250 has 32 divisors (see below), whose sum is σ = 201488045616. Its totient is φ = 41458435200.
The previous prime is 105639295249. The next prime is 105639295253. The reversal of 105639295250 is 52592936501.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 13261595281 + 92377699969 = 115159^2 + 303937^2 .
It is a super-2 number, since 2×1056392952502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105639295195 and 105639295204.
It is not an unprimeable number, because it can be changed into a prime (105639295253) 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 15 ways as a sum of consecutive naturals, for example, 3973139 + ... + 3999638.
Almost surely, 2105639295250 is an apocalyptic number.
105639295250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105639295250 is a deficient number, since it is larger than the sum of its proper divisors (95848750366).
105639295250 is an equidigital number, since it uses as much as digits as its factorization.
105639295250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7972847 (or 7972837 counting only the distinct ones).
The product of its (nonzero) digits is 729000, while the sum is 47.
The spelling of 105639295250 in words is "one hundred five billion, six hundred thirty-nine million, two hundred ninety-five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •