Base | Representation |
---|---|
bin | 10011101001110001… |
… | …110100111100101001 |
3 | 2000110122011210211201 |
4 | 103221301310330221 |
5 | 321204104204231 |
6 | 13405533324201 |
7 | 1344633142213 |
oct | 235161647451 |
9 | 60418153751 |
10 | 21102022441 |
11 | 8a495a5875 |
12 | 410b036661 |
13 | 1cb3ab6016 |
14 | 10427cd5b3 |
15 | 8378a1161 |
hex | 4e9c74f29 |
21102022441 has 4 divisors (see below), whose sum is σ = 21299237712. Its totient is φ = 20904807172.
The previous prime is 21102022427. The next prime is 21102022489. The reversal of 21102022441 is 14422020112.
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 a cyclic number.
It is not a de Polignac number, because 21102022441 - 221 = 21099925289 is a prime.
It is a super-2 number, since 2×211020224412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21102022411) 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 3 ways as a sum of consecutive naturals, for example, 98607475 + ... + 98607688.
It is an arithmetic number, because the mean of its divisors is an integer number (5324809428).
Almost surely, 221102022441 is an apocalyptic number.
It is an amenable number.
21102022441 is a deficient number, since it is larger than the sum of its proper divisors (197215271).
21102022441 is a wasteful number, since it uses less digits than its factorization.
21102022441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197215270.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 21102022441 its reverse (14422020112), we get a palindrome (35524042553).
The spelling of 21102022441 in words is "twenty-one billion, one hundred two million, twenty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •