Base | Representation |
---|---|
bin | 10100000011111100… |
… | …111100100111001001 |
3 | 2001121020110112210102 |
4 | 110003330330213021 |
5 | 323104013120113 |
6 | 13521301255145 |
7 | 1361544466052 |
oct | 240374744711 |
9 | 61536415712 |
10 | 21541145033 |
11 | 9154462101 |
12 | 42121044b5 |
13 | 2053a74985 |
14 | 1084c59729 |
15 | 8611e1758 |
hex | 503f3c9c9 |
21541145033 has 4 divisors (see below), whose sum is σ = 22123338180. Its totient is φ = 20958951888.
The previous prime is 21541145011. The next prime is 21541145069. The reversal of 21541145033 is 33054114512.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19324336144 + 2216808889 = 139012^2 + 47083^2 .
It is a cyclic number.
It is not a de Polignac number, because 21541145033 - 26 = 21541144969 is a prime.
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 = 21541144987 and 21541145005.
It is not an unprimeable number, because it can be changed into a prime (21541141033) 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, 291096518 + ... + 291096591.
It is an arithmetic number, because the mean of its divisors is an integer number (5530834545).
Almost surely, 221541145033 is an apocalyptic number.
It is an amenable number.
21541145033 is a deficient number, since it is larger than the sum of its proper divisors (582193147).
21541145033 is an equidigital number, since it uses as much as digits as its factorization.
21541145033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 582193146.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 21541145033 its reverse (33054114512), we get a palindrome (54595259545).
The spelling of 21541145033 in words is "twenty-one billion, five hundred forty-one million, one hundred forty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •