Base | Representation |
---|---|
bin | 1001100011110011010000… |
… | …11000100000001001011101 |
3 | 2202102121201000111010101001 |
4 | 10301321220120200021131 |
5 | 10223403131211401341 |
6 | 112413021151550301 |
7 | 4266511636003336 |
oct | 461715030401135 |
9 | 82377630433331 |
10 | 21021321200221 |
11 | 677510187a261 |
12 | 24360a5b2b391 |
13 | b963c08a5984 |
14 | 52961a22928d |
15 | 266c2d344d31 |
hex | 131e6862025d |
21021321200221 has 8 divisors (see below), whose sum is σ = 21704290550784. Its totient is φ = 20338655738160.
The previous prime is 21021321200207. The next prime is 21021321200239. The reversal of 21021321200221 is 12200212312012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21021321200221 - 25 = 21021321200189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21021321200021) 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 7 ways as a sum of consecutive naturals, for example, 75831526 + ... + 76108231.
It is an arithmetic number, because the mean of its divisors is an integer number (2713036318848).
Almost surely, 221021321200221 is an apocalyptic number.
It is an amenable number.
21021321200221 is a deficient number, since it is larger than the sum of its proper divisors (682969350563).
21021321200221 is a wasteful number, since it uses less digits than its factorization.
21021321200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151944251.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 21021321200221 its reverse (12200212312012), we get a palindrome (33221533512233).
The spelling of 21021321200221 in words is "twenty-one trillion, twenty-one billion, three hundred twenty-one million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •