Base | Representation |
---|---|
bin | 1100100010100… |
… | …11100110110100 |
3 | 21022221201100020 |
4 | 12101103212310 |
5 | 203412400202 |
6 | 14234445140 |
7 | 2415120456 |
oct | 621234664 |
9 | 238851306 |
10 | 105200052 |
11 | 544233a1 |
12 | 2b2937b0 |
13 | 18a44669 |
14 | dd862d6 |
15 | 93805bc |
hex | 64539b4 |
105200052 has 24 divisors (see below), whose sum is σ = 253932000. Its totient is φ = 33857376.
The previous prime is 105200041. The next prime is 105200057. The reversal of 105200052 is 250002501.
It is a super-2 number, since 2×1052000522 = 22134101881605408, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105200057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 150802 + ... + 151497.
It is an arithmetic number, because the mean of its divisors is an integer number (10580500).
Almost surely, 2105200052 is an apocalyptic number.
105200052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105200052 is an abundant number, since it is smaller than the sum of its proper divisors (148731948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105200052 is a wasteful number, since it uses less digits than its factorization.
105200052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302335 (or 302333 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 105200052 is about 10256.7076588933. The cubic root of 105200052 is about 472.0688219574.
Adding to 105200052 its reverse (250002501), we get a palindrome (355202553).
The spelling of 105200052 in words is "one hundred five million, two hundred thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •