Base | Representation |
---|---|
bin | 1001101001101001000011… |
… | …10001110101100010100101 |
3 | 2210010210200200021121111022 |
4 | 10310310201301311202211 |
5 | 10240200124012401041 |
6 | 113045130253420525 |
7 | 4320144642462236 |
oct | 464644161654245 |
9 | 83123620247438 |
10 | 21222000122021 |
11 | 68422218a3456 |
12 | 2468b70a9a745 |
13 | bac2c276410a |
14 | 53521655908d |
15 | 26c0761c624b |
hex | 134d21c758a5 |
21222000122021 has 4 divisors (see below), whose sum is σ = 21352196441952. Its totient is φ = 21091803802092.
The previous prime is 21222000121957. The next prime is 21222000122039. The reversal of 21222000122021 is 12022100022212.
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 21222000122021 - 26 = 21222000121957 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 (21222000122041) 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, 65098159721 + ... + 65098160046.
It is an arithmetic number, because the mean of its divisors is an integer number (5338049110488).
Almost surely, 221222000122021 is an apocalyptic number.
It is an amenable number.
21222000122021 is a deficient number, since it is larger than the sum of its proper divisors (130196319931).
21222000122021 is a wasteful number, since it uses less digits than its factorization.
21222000122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130196319930.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 21222000122021 its reverse (12022100022212), we get a palindrome (33244100144233).
The spelling of 21222000122021 in words is "twenty-one trillion, two hundred twenty-two billion, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •