Base | Representation |
---|---|
bin | 100100011000111… |
… | …0010001100100100 |
3 | 10011002112202010110 |
4 | 1020301302030210 |
5 | 10000034311322 |
6 | 321054253020 |
7 | 42154262352 |
oct | 11061621444 |
9 | 3132482113 |
10 | 1221010212 |
11 | 577257054 |
12 | 2a0ab7170 |
13 | 165c6c666 |
14 | b823c7d2 |
15 | 722dac0c |
hex | 48c72324 |
1221010212 has 48 divisors (see below), whose sum is σ = 2930945472. Its totient is φ = 395337600.
The previous prime is 1221010201. The next prime is 1221010213. The reversal of 1221010212 is 2120101221.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (1221010213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 309283 + ... + 313205.
It is an arithmetic number, because the mean of its divisors is an integer number (61061364).
Almost surely, 21221010212 is an apocalyptic number.
1221010212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1221010212 is an abundant number, since it is smaller than the sum of its proper divisors (1709935260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221010212 is a wasteful number, since it uses less digits than its factorization.
1221010212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4668 (or 4666 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 1221010212 is about 34942.9565434867. The cubic root of 1221010212 is about 1068.8245781684.
Adding to 1221010212 its reverse (2120101221), we get a palindrome (3341111433).
It can be divided in two parts, 12210 and 10212, that added together give a palindrome (22422).
The spelling of 1221010212 in words is "one billion, two hundred twenty-one million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •