Base | Representation |
---|---|
bin | 1011100100100101… |
… | …0000110101011101 |
3 | 22000110212222110211 |
4 | 2321021100311131 |
5 | 22330142310323 |
6 | 1232120532421 |
7 | 136655243125 |
oct | 27111206535 |
9 | 8013788424 |
10 | 3106213213 |
11 | 1354415a64 |
12 | 728321111 |
13 | 3a66c20ac |
14 | 216773c85 |
15 | 132a7470d |
hex | b9250d5d |
3106213213 has 2 divisors, whose sum is σ = 3106213214. Its totient is φ = 3106213212.
The previous prime is 3106213211. The next prime is 3106213267. The reversal of 3106213213 is 3123126013.
3106213213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3052894009 + 53319204 = 55253^2 + 7302^2 .
It is a cyclic number.
It is not a de Polignac number, because 3106213213 - 21 = 3106213211 is a prime.
Together with 3106213211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3106213211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1553106606 + 1553106607.
It is an arithmetic number, because the mean of its divisors is an integer number (1553106607).
Almost surely, 23106213213 is an apocalyptic number.
It is an amenable number.
3106213213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3106213213 is an equidigital number, since it uses as much as digits as its factorization.
3106213213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 3106213213 is about 55733.4119985489. The cubic root of 3106213213 is about 1459.0732238307.
Adding to 3106213213 its reverse (3123126013), we get a palindrome (6229339226).
The spelling of 3106213213 in words is "three billion, one hundred six million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •