Base | Representation |
---|---|
bin | 101110111001101111110… |
… | …110011011111100101111 |
3 | 102102010101112001211101012 |
4 | 232321233312123330233 |
5 | 410301403103410411 |
6 | 10504401141535435 |
7 | 451601321036252 |
oct | 56715766337457 |
9 | 12363345054335 |
10 | 3223102013231 |
11 | 1032a010733a1 |
12 | 4407aa41457b |
13 | 1a4c250a8199 |
14 | b1ddb25d099 |
15 | 58c90e2918b |
hex | 2ee6fd9bf2f |
3223102013231 has 2 divisors, whose sum is σ = 3223102013232. Its totient is φ = 3223102013230.
The previous prime is 3223102013203. The next prime is 3223102013233. The reversal of 3223102013231 is 1323102013223.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3223102013231 - 26 = 3223102013167 is a prime.
It is a super-2 number, since 2×32231020132312 (a number of 26 digits) contains 22 as substring.
Together with 3223102013233, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3223102013197 and 3223102013206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3223102013233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611551006615 + 1611551006616.
It is an arithmetic number, because the mean of its divisors is an integer number (1611551006616).
Almost surely, 23223102013231 is an apocalyptic number.
3223102013231 is a deficient number, since it is larger than the sum of its proper divisors (1).
3223102013231 is an equidigital number, since it uses as much as digits as its factorization.
3223102013231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 3223102013231 its reverse (1323102013223), we get a palindrome (4546204026454).
The spelling of 3223102013231 in words is "three trillion, two hundred twenty-three billion, one hundred two million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •