Base | Representation |
---|---|
bin | 110001001011001110… |
… | …0110111000011101010 |
3 | 101002120200100200022112 |
4 | 1202112130313003222 |
5 | 3212233430104200 |
6 | 120302530322322 |
7 | 10425643526633 |
oct | 1422634670352 |
9 | 332520320275 |
10 | 105603363050 |
11 | 40871388759 |
12 | 185724293a2 |
13 | 9c5c673893 |
14 | 517b30288a |
15 | 2b31125535 |
hex | 18967370ea |
105603363050 has 24 divisors (see below), whose sum is σ = 196519826316. Its totient is φ = 42220362240.
The previous prime is 105603363043. The next prime is 105603363121. The reversal of 105603363050 is 50363306501.
It can be written as a sum of positive squares in 6 ways, for example, as 23949729049 + 81653634001 = 154757^2 + 285751^2 .
It is a super-2 number, since 2×1056033630502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105603362998 and 105603363016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 422717 + ... + 624416.
Almost surely, 2105603363050 is an apocalyptic number.
105603363050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105603363050 is a deficient number, since it is larger than the sum of its proper divisors (90916463266).
105603363050 is a wasteful number, since it uses less digits than its factorization.
105603363050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049162 (or 1049157 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 32.
Adding to 105603363050 its reverse (50363306501), we get a palindrome (155966669551).
The spelling of 105603363050 in words is "one hundred five billion, six hundred three million, three hundred sixty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •