Base | Representation |
---|---|
bin | 101110111000000000010… |
… | …010011111111001000111 |
3 | 102101221120002011000121222 |
4 | 232320000102133321013 |
5 | 410234034430234343 |
6 | 10503451321030555 |
7 | 451504042650245 |
oct | 56700022377107 |
9 | 12357502130558 |
10 | 3221230321223 |
11 | 10321305a24a2 |
12 | 44036762545b |
13 | 1a49b73a6415 |
14 | b1ca0843795 |
15 | 58bd195da68 |
hex | 2ee0049fe47 |
3221230321223 has 2 divisors, whose sum is σ = 3221230321224. Its totient is φ = 3221230321222.
The previous prime is 3221230321201. The next prime is 3221230321229.
3221230321223 is nontrivially palindromic in base 10.
3221230321223 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 3221230321223 - 28 = 3221230320967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3221230321192 and 3221230321201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3221230321229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1610615160611 + 1610615160612.
It is an arithmetic number, because the mean of its divisors is an integer number (1610615160612).
Almost surely, 23221230321223 is an apocalyptic number.
3221230321223 is a deficient number, since it is larger than the sum of its proper divisors (1).
3221230321223 is an equidigital number, since it uses as much as digits as its factorization.
3221230321223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 26.
It can be divided in two parts, 3221230 and 321223, that added together give a palindrome (3542453).
The spelling of 3221230321223 in words is "three trillion, two hundred twenty-one billion, two hundred thirty million, three hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.205 sec. • engine limits •