Base | Representation |
---|---|
bin | 101101110110… |
… | …110101111001 |
3 | 211121201212102 |
4 | 231312311321 |
5 | 11034133423 |
6 | 1105353145 |
7 | 204114656 |
oct | 55666571 |
9 | 24551772 |
10 | 12021113 |
11 | 6870705 |
12 | 40387b5 |
13 | 264b7b0 |
14 | 184cc2d |
15 | 10c6c28 |
hex | b76d79 |
12021113 has 8 divisors (see below), whose sum is σ = 13080648. Its totient is φ = 10980864.
The previous prime is 12021071. The next prime is 12021131. The reversal of 12021113 is 31112021.
It can be written as a sum of positive squares in 4 ways, for example, as 1024 + 12020089 = 32^2 + 3467^2 .
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 12021113 - 222 = 7826809 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12021094 and 12021103.
It is not an unprimeable number, because it can be changed into a prime (12021013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3506 + ... + 6027.
It is an arithmetic number, because the mean of its divisors is an integer number (1635081).
Almost surely, 212021113 is an apocalyptic number.
12021113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12021113 is a deficient number, since it is larger than the sum of its proper divisors (1059535).
12021113 is an equidigital number, since it uses as much as digits as its factorization.
12021113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9643.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 12021113 is about 3467.1476749628. The cubic root of 12021113 is about 229.0770384639.
Adding to 12021113 its reverse (31112021), we get a palindrome (43133134).
The spelling of 12021113 in words is "twelve million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •