Base | Representation |
---|---|
bin | 101110001010… |
… | …110101100101 |
3 | 211202220012202 |
4 | 232022311211 |
5 | 11044244023 |
6 | 1111224245 |
7 | 204605516 |
oct | 56126545 |
9 | 24686182 |
10 | 12103013 |
11 | 691719a |
12 | 4078085 |
13 | 2679b60 |
14 | 1870a0d |
15 | 10e1128 |
hex | b8ad65 |
12103013 has 8 divisors (see below), whose sum is σ = 13076448. Its totient is φ = 11135664.
The previous prime is 12103009. The next prime is 12103043. The reversal of 12103013 is 31030121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12103013 - 22 = 12103009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12102985 and 12103003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12103043) 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, 3170 + ... + 5852.
It is an arithmetic number, because the mean of its divisors is an integer number (1634556).
Almost surely, 212103013 is an apocalyptic number.
12103013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12103013 is a deficient number, since it is larger than the sum of its proper divisors (973435).
12103013 is a wasteful number, since it uses less digits than its factorization.
12103013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3043.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 12103013 is about 3478.9384875275. The cubic root of 12103013 is about 229.5960964121.
Adding to 12103013 its reverse (31030121), we get a palindrome (43133134).
The spelling of 12103013 in words is "twelve million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •