Search a number
-
+
3211117123 is a prime number
BaseRepresentation
bin1011111101100101…
…1100001001000011
322021210021122120211
42333121130021003
523034021221443
61250345214551
7142401021334
oct27731341103
98253248524
103211117123
1113a8656905
12757491457
133c2361a06
1422668028b
1513bd9719d
hexbf65c243

3211117123 has 2 divisors, whose sum is σ = 3211117124. Its totient is φ = 3211117122.

The previous prime is 3211117093. The next prime is 3211117153. The reversal of 3211117123 is 3217111123.

It is a balanced prime because it is at equal distance from previous prime (3211117093) and next prime (3211117153).

It is a cyclic number.

It is not a de Polignac number, because 3211117123 - 213 = 3211108931 is a prime.

It is a super-2 number, since 2×32111171232 = 20622546355247594258, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 3211117094 and 3211117103.

It is not a weakly prime, because it can be changed into another prime (3211117153) 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, 1605558561 + 1605558562.

It is an arithmetic number, because the mean of its divisors is an integer number (1605558562).

Almost surely, 23211117123 is an apocalyptic number.

3211117123 is a deficient number, since it is larger than the sum of its proper divisors (1).

3211117123 is an equidigital number, since it uses as much as digits as its factorization.

3211117123 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 252, while the sum is 22.

The square root of 3211117123 is about 56666.7197127203. The cubic root of 3211117123 is about 1475.3171200563.

Adding to 3211117123 its reverse (3217111123), we get a palindrome (6428228246).

The spelling of 3211117123 in words is "three billion, two hundred eleven million, one hundred seventeen thousand, one hundred twenty-three".