Base | Representation |
---|---|
bin | 1001101001100111001101… |
… | …10101000001010101010101 |
3 | 2210010201010202021010201121 |
4 | 10310303212311001111111 |
5 | 10240141112320213023 |
6 | 113044444203323541 |
7 | 4320111303106123 |
oct | 464634665012525 |
9 | 83121122233647 |
10 | 21221011101013 |
11 | 6841864599319 |
12 | 24689358205b1 |
13 | bac19589c299 |
14 | 535161068913 |
15 | 26c019462d5d |
hex | 134ce6d41555 |
21221011101013 has 4 divisors (see below), whose sum is σ = 21227669720800. Its totient is φ = 21214352481228.
The previous prime is 21221011100987. The next prime is 21221011101023. The reversal of 21221011101013 is 31010111012212.
It is a happy number.
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 21221011101013 - 229 = 21220474230101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221011101023) 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, 3329305113 + ... + 3329311486.
It is an arithmetic number, because the mean of its divisors is an integer number (5306917430200).
Almost surely, 221221011101013 is an apocalyptic number.
It is an amenable number.
21221011101013 is a deficient number, since it is larger than the sum of its proper divisors (6658619787).
21221011101013 is an equidigital number, since it uses as much as digits as its factorization.
21221011101013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6658619786.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 21221011101013 its reverse (31010111012212), we get a palindrome (52231122113225).
The spelling of 21221011101013 in words is "twenty-one trillion, two hundred twenty-one billion, eleven million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •