Base | Representation |
---|---|
bin | 110001000100011111… |
… | …1110101010110000010 |
3 | 101001222221122021021210 |
4 | 1202020333311112002 |
5 | 3211303134300200 |
6 | 120224304430550 |
7 | 10420233150351 |
oct | 1421077652602 |
9 | 331887567253 |
10 | 105377650050 |
11 | 40765a33192 |
12 | 1850a918456 |
13 | 9c249859aa |
14 | 5159349998 |
15 | 2b1b3dc650 |
hex | 1888ff5582 |
105377650050 has 48 divisors (see below), whose sum is σ = 261381743712. Its totient is φ = 28095849600.
The previous prime is 105377650039. The next prime is 105377650061. The reversal of 105377650050 is 50056773501.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (105377650039) and next prime (105377650061).
It is a super-2 number, since 2×1053776500502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105377649990 and 105377650008.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 855982 + ... + 971318.
It is an arithmetic number, because the mean of its divisors is an integer number (5445452994).
Almost surely, 2105377650050 is an apocalyptic number.
105377650050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105377650050 is an abundant number, since it is smaller than the sum of its proper divisors (156004093662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105377650050 is a wasteful number, since it uses less digits than its factorization.
105377650050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121443 (or 121438 counting only the distinct ones).
The product of its (nonzero) digits is 110250, while the sum is 39.
The spelling of 105377650050 in words is "one hundred five billion, three hundred seventy-seven million, six hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •