Base | Representation |
---|---|
bin | 100111011011011… |
… | …1001000000011001 |
3 | 10102012110222102221 |
4 | 1032312321000121 |
5 | 10202142341441 |
6 | 335140424041 |
7 | 44533263124 |
oct | 11666710031 |
9 | 3365428387 |
10 | 1323012121 |
11 | 619895652 |
12 | 30b0a8021 |
13 | 181134412 |
14 | c79d13bb |
15 | 7b2388d1 |
hex | 4edb9019 |
1323012121 has 2 divisors, whose sum is σ = 1323012122. Its totient is φ = 1323012120.
The previous prime is 1323012113. The next prime is 1323012133. The reversal of 1323012121 is 1212103231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1040772121 + 282240000 = 32261^2 + 16800^2 .
It is a cyclic number.
It is not a de Polignac number, because 1323012121 - 23 = 1323012113 is a prime.
It is a super-2 number, since 2×13230121212 = 3500722144625837282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1323012095 and 1323012104.
It is not a weakly prime, because it can be changed into another prime (1323012181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661506060 + 661506061.
It is an arithmetic number, because the mean of its divisors is an integer number (661506061).
Almost surely, 21323012121 is an apocalyptic number.
It is an amenable number.
1323012121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323012121 is an equidigital number, since it uses as much as digits as its factorization.
1323012121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1323012121 is about 36373.2335791032. The cubic root of 1323012121 is about 1097.7950655624.
Adding to 1323012121 its reverse (1212103231), we get a palindrome (2535115352).
The spelling of 1323012121 in words is "one billion, three hundred twenty-three million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •