Base | Representation |
---|---|
bin | 100100001000000… |
… | …1110000001111001 |
3 | 10010110222201022121 |
4 | 1020100032001321 |
5 | 4440311230241 |
6 | 320141521241 |
7 | 42016424536 |
oct | 11020160171 |
9 | 3113881277 |
10 | 1212211321 |
11 | 572297342 |
12 | 299b73221 |
13 | 1641ab709 |
14 | b6dcbd8d |
15 | 7164dad1 |
hex | 4840e079 |
1212211321 has 8 divisors (see below), whose sum is σ = 1254032384. Its totient is φ = 1170560160.
The previous prime is 1212211307. The next prime is 1212211373. The reversal of 1212211321 is 1231122121.
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 1212211321 - 219 = 1211687033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1212211295 and 1212211304.
It is not an unprimeable number, because it can be changed into a prime (1212211421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27876 + ... + 56581.
It is an arithmetic number, because the mean of its divisors is an integer number (156754048).
Almost surely, 21212211321 is an apocalyptic number.
It is an amenable number.
1212211321 is a deficient number, since it is larger than the sum of its proper divisors (41821063).
1212211321 is an equidigital number, since it uses as much as digits as its factorization.
1212211321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84951.
The product of its digits is 48, while the sum is 16.
The square root of 1212211321 is about 34816.8252573379. The cubic root of 1212211321 is about 1066.2509845893.
Adding to 1212211321 its reverse (1231122121), we get a palindrome (2443333442).
The spelling of 1212211321 in words is "one billion, two hundred twelve million, two hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •