Base | Representation |
---|---|
bin | 1001101001101011010101… |
… | …00000100010000000010011 |
3 | 2210010220211201022012122002 |
4 | 10310311222200202000103 |
5 | 10240210123400303243 |
6 | 113045451322504215 |
7 | 4320220120142435 |
oct | 464655240420023 |
9 | 83126751265562 |
10 | 21223220322323 |
11 | 6842798646a58 |
12 | 246925166506b |
13 | bac4584abc26 |
14 | 5352d0626655 |
15 | 26c0e83a1eb8 |
hex | 134d6a822013 |
21223220322323 has 4 divisors (see below), whose sum is σ = 21429271005168. Its totient is φ = 21017169639480.
The previous prime is 21223220322289. The next prime is 21223220322349. The reversal of 21223220322323 is 32322302232212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21223220322323 - 222 = 21223216128019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21223220322383) 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, 103025341268 + ... + 103025341473.
It is an arithmetic number, because the mean of its divisors is an integer number (5357317751292).
Almost surely, 221223220322323 is an apocalyptic number.
21223220322323 is a deficient number, since it is larger than the sum of its proper divisors (206050682845).
21223220322323 is a wasteful number, since it uses less digits than its factorization.
21223220322323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206050682844.
The product of its (nonzero) digits is 20736, while the sum is 29.
Adding to 21223220322323 its reverse (32322302232212), we get a palindrome (53545522554535).
The spelling of 21223220322323 in words is "twenty-one trillion, two hundred twenty-three billion, two hundred twenty million, three hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •