Base | Representation |
---|---|
bin | 100111011001101… |
… | …1101010001100101 |
3 | 10102010210020211212 |
4 | 1032303131101211 |
5 | 10201430041401 |
6 | 335105241205 |
7 | 44522524142 |
oct | 11663352145 |
9 | 3363706755 |
10 | 1322112101 |
11 | 619330432 |
12 | 30a933205 |
13 | 180baa86b |
14 | c78393c9 |
15 | 7b10bdbb |
hex | 4ecdd465 |
1322112101 has 2 divisors, whose sum is σ = 1322112102. Its totient is φ = 1322112100.
The previous prime is 1322112031. The next prime is 1322112137. The reversal of 1322112101 is 1012112231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 932997025 + 389115076 = 30545^2 + 19726^2 .
It is a cyclic number.
It is not a de Polignac number, because 1322112101 - 230 = 248370277 is a prime.
It is a super-2 number, since 2×13221121012 = 3495960815221268402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1322115101) 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, 661056050 + 661056051.
It is an arithmetic number, because the mean of its divisors is an integer number (661056051).
Almost surely, 21322112101 is an apocalyptic number.
It is an amenable number.
1322112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322112101 is an equidigital number, since it uses as much as digits as its factorization.
1322112101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1322112101 is about 36360.8594645396. The cubic root of 1322112101 is about 1097.5460727195.
Adding to 1322112101 its reverse (1012112231), we get a palindrome (2334224332).
The spelling of 1322112101 in words is "one billion, three hundred twenty-two million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •