Base | Representation |
---|---|
bin | 110001000010001100… |
… | …1100110110101111000 |
3 | 101001210120111200011211 |
4 | 1202010121212311320 |
5 | 3211123413122222 |
6 | 120212511332504 |
7 | 10415305440331 |
oct | 1420431466570 |
9 | 331716450154 |
10 | 105300520312 |
11 | 407264424a9 |
12 | 184a8b21134 |
13 | 9c119bbbb0 |
14 | 514cdcd288 |
15 | 2b14754277 |
hex | 1884666d78 |
105300520312 has 64 divisors (see below), whose sum is σ = 224438407200. Its totient is φ = 46042020864.
The previous prime is 105300520253. The next prime is 105300520327. The reversal of 105300520312 is 213025003501.
It is a super-2 number, since 2×1053005203122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 639528 + ... + 787144.
Almost surely, 2105300520312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105300520312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112219203600).
105300520312 is an abundant number, since it is smaller than the sum of its proper divisors (119137886888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105300520312 is a wasteful number, since it uses less digits than its factorization.
105300520312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147693 (or 147651 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 22.
Adding to 105300520312 its reverse (213025003501), we get a palindrome (318325523813).
The spelling of 105300520312 in words is "one hundred five billion, three hundred million, five hundred twenty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •