Base | Representation |
---|---|
bin | 10011110000111100… |
… | …011010111100001101 |
3 | 2000210000101111100101 |
4 | 103300330122330031 |
5 | 321430343140023 |
6 | 13425510131101 |
7 | 1350623030602 |
oct | 236074327415 |
9 | 60700344311 |
10 | 21222240013 |
11 | 9000446037 |
12 | 4143350a91 |
13 | 2002987c90 |
14 | 10547646a9 |
15 | 8431eb1ad |
hex | 4f0f1af0d |
21222240013 has 8 divisors (see below), whose sum is σ = 22857670808. Its totient is φ = 19587230784.
The previous prime is 21222239993. The next prime is 21222240023. The reversal of 21222240013 is 31004222212.
It can be written as a sum of positive squares in 4 ways, for example, as 11812969 + 21210427044 = 3437^2 + 145638^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 21222240013 - 233 = 12632305421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21222240023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3331 + ... + 206047.
It is an arithmetic number, because the mean of its divisors is an integer number (2857208851).
Almost surely, 221222240013 is an apocalyptic number.
It is an amenable number.
21222240013 is a deficient number, since it is larger than the sum of its proper divisors (1635430795).
21222240013 is a wasteful number, since it uses less digits than its factorization.
21222240013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210783.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 21222240013 its reverse (31004222212), we get a palindrome (52226462225).
The spelling of 21222240013 in words is "twenty-one billion, two hundred twenty-two million, two hundred forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •