Base | Representation |
---|---|
bin | 1001101001101011010110… |
… | …01001010110000000101101 |
3 | 2210010220212110102202121010 |
4 | 10310311223021112000231 |
5 | 10240210134120133401 |
6 | 113045452344055433 |
7 | 4320220310112264 |
oct | 464655311260055 |
9 | 83126773382533 |
10 | 21223231021101 |
11 | 68427a369411a |
12 | 2469255164579 |
13 | bac45a786875 |
14 | 5352d1c0d5db |
15 | 26c0e92b6ed6 |
hex | 134d6b25602d |
21223231021101 has 4 divisors (see below), whose sum is σ = 28297641361472. Its totient is φ = 14148820680732.
The previous prime is 21223231021073. The next prime is 21223231021127. The reversal of 21223231021101 is 10112013232212.
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 21223231021101 - 27 = 21223231020973 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 (21223231021501) 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, 3537205170181 + ... + 3537205170186.
It is an arithmetic number, because the mean of its divisors is an integer number (7074410340368).
Almost surely, 221223231021101 is an apocalyptic number.
It is an amenable number.
21223231021101 is a deficient number, since it is larger than the sum of its proper divisors (7074410340371).
21223231021101 is an equidigital number, since it uses as much as digits as its factorization.
21223231021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7074410340370.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 21223231021101 its reverse (10112013232212), we get a palindrome (31335244253313).
The spelling of 21223231021101 in words is "twenty-one trillion, two hundred twenty-three billion, two hundred thirty-one million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •