Base | Representation |
---|---|
bin | 10011110001000100… |
… | …110010101001111111 |
3 | 2000210011111222100101 |
4 | 103301010302221333 |
5 | 321431423344203 |
6 | 13430025141531 |
7 | 1350650500132 |
oct | 236104625177 |
9 | 60704458311 |
10 | 21224434303 |
11 | 90017046a6 |
12 | 414402a8a7 |
13 | 2003275987 |
14 | 1054b76219 |
15 | 8434d141d |
hex | 4f1132a7f |
21224434303 has 8 divisors (see below), whose sum is σ = 21276097920. Its totient is φ = 21172824600.
The previous prime is 21224434271. The next prime is 21224434321. The reversal of 21224434303 is 30343442212.
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 21224434303 - 25 = 21224434271 is a prime.
It is a super-3 number, since 3×212244343033 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21224435303) 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, 839278 + ... + 864196.
It is an arithmetic number, because the mean of its divisors is an integer number (2659512240).
Almost surely, 221224434303 is an apocalyptic number.
21224434303 is a deficient number, since it is larger than the sum of its proper divisors (51663617).
21224434303 is a wasteful number, since it uses less digits than its factorization.
21224434303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26957.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 21224434303 its reverse (30343442212), we get a palindrome (51567876515).
The spelling of 21224434303 in words is "twenty-one billion, two hundred twenty-four million, four hundred thirty-four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •