Base | Representation |
---|---|
bin | 10011100101000001… |
… | …101101101111000001 |
3 | 2000021002011112202020 |
4 | 103211001231233001 |
5 | 321023202113441 |
6 | 13354004512053 |
7 | 1342644416433 |
oct | 234501555701 |
9 | 60232145666 |
10 | 21022301121 |
11 | 8a085a4a88 |
12 | 40a83ab629 |
13 | 1ca0422743 |
14 | 1035d9a653 |
15 | 8308a4e66 |
hex | 4e506dbc1 |
21022301121 has 4 divisors (see below), whose sum is σ = 28029734832. Its totient is φ = 14014867412.
The previous prime is 21022301101. The next prime is 21022301161. The reversal of 21022301121 is 12110322012.
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 21022301121 - 27 = 21022300993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21022301121.
It is not an unprimeable number, because it can be changed into a prime (21022301101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3503716851 + ... + 3503716856.
It is an arithmetic number, because the mean of its divisors is an integer number (7007433708).
Almost surely, 221022301121 is an apocalyptic number.
It is an amenable number.
21022301121 is a deficient number, since it is larger than the sum of its proper divisors (7007433711).
21022301121 is an equidigital number, since it uses as much as digits as its factorization.
21022301121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7007433710.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 21022301121 its reverse (12110322012), we get a palindrome (33132623133).
The spelling of 21022301121 in words is "twenty-one billion, twenty-two million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •