Base | Representation |
---|---|
bin | 101000000010001… |
… | …0111100000001001 |
3 | 10110121200211112011 |
4 | 1100010113200021 |
5 | 10222342301441 |
6 | 341144015521 |
7 | 45201023011 |
oct | 12004274011 |
9 | 3417624464 |
10 | 1343322121 |
11 | 62a2a7879 |
12 | 315a615a1 |
13 | 1853c597b |
14 | ca59ac41 |
15 | 7cdeb581 |
hex | 50117809 |
1343322121 has 2 divisors, whose sum is σ = 1343322122. Its totient is φ = 1343322120.
The previous prime is 1343322109. The next prime is 1343322143. The reversal of 1343322121 is 1212233431.
It is an a-pointer prime, because the next prime (1343322143) can be obtained adding 1343322121 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 764246025 + 579076096 = 27645^2 + 24064^2 .
It is a cyclic number.
It is not a de Polignac number, because 1343322121 - 225 = 1309767689 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1343322092 and 1343322101.
It is not a weakly prime, because it can be changed into another prime (1343322161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671661060 + 671661061.
It is an arithmetic number, because the mean of its divisors is an integer number (671661061).
Almost surely, 21343322121 is an apocalyptic number.
It is an amenable number.
1343322121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1343322121 is an equidigital number, since it uses as much as digits as its factorization.
1343322121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 864, while the sum is 22.
The square root of 1343322121 is about 36651.3590607497. The cubic root of 1343322121 is about 1103.3841019731.
Adding to 1343322121 its reverse (1212233431), we get a palindrome (2555555552).
The spelling of 1343322121 in words is "one billion, three hundred forty-three million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •