Base | Representation |
---|---|
bin | 101110100010… |
… | …110000111101 |
3 | 211221212122200 |
4 | 232202300331 |
5 | 11110413041 |
6 | 1113302113 |
7 | 205464330 |
oct | 56426075 |
9 | 24855580 |
10 | 12201021 |
11 | 6983898 |
12 | 4104939 |
13 | 26b2651 |
14 | 1898617 |
15 | 11101b6 |
hex | ba2c3d |
12201021 has 24 divisors (see below), whose sum is σ = 21203520. Its totient is φ = 6604416.
The previous prime is 12200989. The next prime is 12201041. The reversal of 12201021 is 12010221.
It is not a de Polignac number, because 12201021 - 25 = 12200989 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 12200994 and 12201012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201041) 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 23 ways as a sum of consecutive naturals, for example, 3900 + ... + 6293.
It is an arithmetic number, because the mean of its divisors is an integer number (883480).
Almost surely, 212201021 is an apocalyptic number.
It is an amenable number.
12201021 is a deficient number, since it is larger than the sum of its proper divisors (9002499).
12201021 is a wasteful number, since it uses less digits than its factorization.
12201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10225 (or 10222 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 12201021 is about 3492.9959919817. The cubic root of 12201021 is about 230.2141735329.
Adding to 12201021 its reverse (12010221), we get a palindrome (24211242).
It can be divided in two parts, 1 and 2201021, that added together give a palindrome (2201022).
The spelling of 12201021 in words is "twelve million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •