Base | Representation |
---|---|
bin | 101110001101… |
… | …011001011100 |
3 | 211210102121011 |
4 | 232031121130 |
5 | 11100113000 |
6 | 1111345004 |
7 | 204651220 |
oct | 56153134 |
9 | 24712534 |
10 | 12113500 |
11 | 6924063 |
12 | 4082164 |
13 | 2681869 |
14 | 1874780 |
15 | 10e42ba |
hex | b8d65c |
12113500 has 48 divisors (see below), whose sum is σ = 30244032. Its totient is φ = 4152000.
The previous prime is 12113489. The next prime is 12113527. The reversal of 12113500 is 531121.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1770 + ... + 5230.
It is an arithmetic number, because the mean of its divisors is an integer number (630084).
Almost surely, 212113500 is an apocalyptic number.
12113500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12113500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15122016).
12113500 is an abundant number, since it is smaller than the sum of its proper divisors (18130532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12113500 is a wasteful number, since it uses less digits than its factorization.
12113500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3487 (or 3475 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 12113500 is about 3480.4453737992. The cubic root of 12113500 is about 229.6623906252.
Adding to 12113500 its reverse (531121), we get a palindrome (12644621).
The spelling of 12113500 in words is "twelve million, one hundred thirteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •