Base | Representation |
---|---|
bin | 1011111110000100… |
… | …0010101101010101 |
3 | 22021221000220102211 |
4 | 2333201002231111 |
5 | 23040024010401 |
6 | 1250500033421 |
7 | 142423661635 |
oct | 27741025525 |
9 | 8257026384 |
10 | 3213110101 |
11 | 13a97981a3 |
12 | 758092871 |
13 | 3c28abba6 |
14 | 226a3c6c5 |
15 | 13c13c951 |
hex | bf842b55 |
3213110101 has 2 divisors, whose sum is σ = 3213110102. Its totient is φ = 3213110100.
The previous prime is 3213110093. The next prime is 3213110123. The reversal of 3213110101 is 1010113123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1632968100 + 1580142001 = 40410^2 + 39751^2 .
It is a cyclic number.
It is not a de Polignac number, because 3213110101 - 23 = 3213110093 is a prime.
It is a super-2 number, since 2×32131101012 = 20648153042296460402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3213110141) 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, 1606555050 + 1606555051.
It is an arithmetic number, because the mean of its divisors is an integer number (1606555051).
Almost surely, 23213110101 is an apocalyptic number.
It is an amenable number.
3213110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3213110101 is an equidigital number, since it uses as much as digits as its factorization.
3213110101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 3213110101 is about 56684.3020685622. The cubic root of 3213110101 is about 1475.6222751749.
Adding to 3213110101 its reverse (1010113123), we get a palindrome (4223223224).
The spelling of 3213110101 in words is "three billion, two hundred thirteen million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •