Base | Representation |
---|---|
bin | 101110001010… |
… | …000111010010 |
3 | 211202202011000 |
4 | 232022013102 |
5 | 11044200200 |
6 | 1111202430 |
7 | 204564054 |
oct | 56120722 |
9 | 24682130 |
10 | 12100050 |
11 | 6914a46 |
12 | 4076416 |
13 | 26786c1 |
14 | 186d8d4 |
15 | 10e0300 |
hex | b8a1d2 |
12100050 has 48 divisors (see below), whose sum is σ = 33346080. Its totient is φ = 3226320.
The previous prime is 12100003. The next prime is 12100057. The reversal of 12100050 is 5000121.
It is a happy number.
It is a super-2 number, since 2×121000502 = 292822420005000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12100057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3132 + ... + 5831.
It is an arithmetic number, because the mean of its divisors is an integer number (694710).
Almost surely, 212100050 is an apocalyptic number.
12100050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12100050 is an abundant number, since it is smaller than the sum of its proper divisors (21246030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12100050 is a wasteful number, since it uses less digits than its factorization.
12100050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8984 (or 8973 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 9.
The square root of 12100050 is about 3478.5126131725. The cubic root of 12100050 is about 229.5773586879.
Adding to 12100050 its reverse (5000121), we get a palindrome (17100171).
The spelling of 12100050 in words is "twelve million, one hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •