Base | Representation |
---|---|
bin | 111001011000000000… |
… | …1010010101111100101 |
3 | 102210000212111221122111 |
4 | 1302300001102233211 |
5 | 4004314311310341 |
6 | 132334121201021 |
7 | 11621212350346 |
oct | 1626001225745 |
9 | 383025457574 |
10 | 123212213221 |
11 | 4828809a499 |
12 | 1ba67630171 |
13 | b807840c56 |
14 | 5d6bbd00cd |
15 | 3311eb7681 |
hex | 1cb0052be5 |
123212213221 has 2 divisors, whose sum is σ = 123212213222. Its totient is φ = 123212213220.
The previous prime is 123212213191. The next prime is 123212213231. The reversal of 123212213221 is 122312212321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88946501121 + 34265712100 = 298239^2 + 185110^2 .
It is a cyclic number.
It is not a de Polignac number, because 123212213221 - 225 = 123178658789 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 123212213192 and 123212213201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123212213231) 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 as a sum of consecutive naturals, namely, 61606106610 + 61606106611.
It is an arithmetic number, because the mean of its divisors is an integer number (61606106611).
Almost surely, 2123212213221 is an apocalyptic number.
It is an amenable number.
123212213221 is a deficient number, since it is larger than the sum of its proper divisors (1).
123212213221 is an equidigital number, since it uses as much as digits as its factorization.
123212213221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 576, while the sum is 22.
Adding to 123212213221 its reverse (122312212321), we get a palindrome (245524425542).
The spelling of 123212213221 in words is "one hundred twenty-three billion, two hundred twelve million, two hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •