Base | Representation |
---|---|
bin | 1001101100100101100110… |
… | …00001101110111001000111 |
3 | 2210111110221221122211101211 |
4 | 10312102303001232321013 |
5 | 10243324424113430343 |
6 | 113203430321232251 |
7 | 4330360204643560 |
oct | 466226301567107 |
9 | 83443857584354 |
10 | 21323221233223 |
11 | 6881144544468 |
12 | 24846bb792687 |
13 | bb8a0424a160 |
14 | 53a099843167 |
15 | 26e9ec71b79d |
hex | 1364b306ee47 |
21323221233223 has 32 divisors (see below), whose sum is σ = 27123463872512. Its totient is φ = 16307050377600.
The previous prime is 21323221233187. The next prime is 21323221233247. The reversal of 21323221233223 is 32233212232312.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21323221233223 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21323221233263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2270508 + ... + 6913873.
It is an arithmetic number, because the mean of its divisors is an integer number (847608246016).
Almost surely, 221323221233223 is an apocalyptic number.
21323221233223 is a deficient number, since it is larger than the sum of its proper divisors (5800242639289).
21323221233223 is a wasteful number, since it uses less digits than its factorization.
21323221233223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9185255.
The product of its digits is 31104, while the sum is 31.
Adding to 21323221233223 its reverse (32233212232312), we get a palindrome (53556433465535).
The spelling of 21323221233223 in words is "twenty-one trillion, three hundred twenty-three billion, two hundred twenty-one million, two hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •