Base | Representation |
---|---|
bin | 10011100100100010… |
… | …111001110010101001 |
3 | 2000020111222012002010 |
4 | 103210202321302221 |
5 | 321014120132131 |
6 | 13353115430133 |
7 | 1342515646206 |
oct | 234442716251 |
9 | 60214865063 |
10 | 21014224041 |
11 | 8a03a88608 |
12 | 40a5755349 |
13 | 1c9b8551c5 |
14 | 1034c96cad |
15 | 82ed0bb46 |
hex | 4e48b9ca9 |
21014224041 has 8 divisors (see below), whose sum is σ = 28034275264. Its totient is φ = 14001827760.
The previous prime is 21014224027. The next prime is 21014224073. The reversal of 21014224041 is 14042241012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21014224041 - 211 = 21014221993 is a prime.
It is a super-2 number, since 2×210142240412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21014223999 and 21014224017.
It is not an unprimeable number, because it can be changed into a prime (21014224001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1907326 + ... + 1918311.
It is an arithmetic number, because the mean of its divisors is an integer number (3504284408).
Almost surely, 221014224041 is an apocalyptic number.
It is an amenable number.
21014224041 is a deficient number, since it is larger than the sum of its proper divisors (7020051223).
21014224041 is a wasteful number, since it uses less digits than its factorization.
21014224041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3827471.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 21014224041 its reverse (14042241012), we get a palindrome (35056465053).
The spelling of 21014224041 in words is "twenty-one billion, fourteen million, two hundred twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •