Base | Representation |
---|---|
bin | 1000010001100101… |
… | …0000001100011001 |
3 | 12201210121021122110 |
4 | 2010121100030121 |
5 | 14022112244231 |
6 | 1004224142533 |
7 | 106020665010 |
oct | 20431201431 |
9 | 5653537573 |
10 | 2221212441 |
11 | a3a8a8868 |
12 | 51ba67a49 |
13 | 29524a8b6 |
14 | 170ddda77 |
15 | d000c046 |
hex | 84650319 |
2221212441 has 16 divisors (see below), whose sum is σ = 3387392000. Its totient is φ = 1268256528.
The previous prime is 2221212421. The next prime is 2221212467. The reversal of 2221212441 is 1442121222.
It is not a de Polignac number, because 2221212441 - 27 = 2221212313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2221212421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14491 + ... + 68208.
It is an arithmetic number, because the mean of its divisors is an integer number (211712000).
Almost surely, 22221212441 is an apocalyptic number.
2221212441 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2221212441 is a deficient number, since it is larger than the sum of its proper divisors (1166179559).
2221212441 is a wasteful number, since it uses less digits than its factorization.
2221212441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83988.
The product of its digits is 512, while the sum is 21.
The square root of 2221212441 is about 47129.7405148808. The cubic root of 2221212441 is about 1304.7581924518.
Adding to 2221212441 its reverse (1442121222), we get a palindrome (3663333663).
The spelling of 2221212441 in words is "two billion, two hundred twenty-one million, two hundred twelve thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •