Base | Representation |
---|---|
bin | 10011101111110111… |
… | …110000011010101001 |
3 | 2000201202112000000202 |
4 | 103233313300122221 |
5 | 321411241140131 |
6 | 13424024241545 |
7 | 1350314031545 |
oct | 235767603251 |
9 | 60652460022 |
10 | 21204240041 |
11 | 8aa1271426 |
12 | 41393102b5 |
13 | 1ccc024cca |
14 | 10521daa25 |
15 | 841842bcb |
hex | 4efdf06a9 |
21204240041 has 4 divisors (see below), whose sum is σ = 21563634000. Its totient is φ = 20844846084.
The previous prime is 21204240037. The next prime is 21204240059. The reversal of 21204240041 is 14004240212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 21204240041 - 22 = 21204240037 is a prime.
It is a super-3 number, since 3×212042400413 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21204239995 and 21204240022.
It is not an unprimeable number, because it can be changed into a prime (21204240011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 179696891 + ... + 179697008.
It is an arithmetic number, because the mean of its divisors is an integer number (5390908500).
Almost surely, 221204240041 is an apocalyptic number.
It is an amenable number.
21204240041 is a deficient number, since it is larger than the sum of its proper divisors (359393959).
21204240041 is an equidigital number, since it uses as much as digits as its factorization.
21204240041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359393958.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 21204240041 its reverse (14004240212), we get a palindrome (35208480253).
The spelling of 21204240041 in words is "twenty-one billion, two hundred four million, two hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •