Base | Representation |
---|---|
bin | 101110110000011101000… |
… | …011100001111011110101 |
3 | 102101011122001210112120101 |
4 | 232300131003201323311 |
5 | 410120433442031401 |
6 | 10500031025034101 |
7 | 451066116612325 |
oct | 56603503417365 |
9 | 12334561715511 |
10 | 3213123002101 |
11 | 1029750194661 |
12 | 43a884485931 |
13 | 1a3cc485927c |
14 | b1731c01285 |
15 | 588a9d15101 |
hex | 2ec1d0e1ef5 |
3213123002101 has 2 divisors, whose sum is σ = 3213123002102. Its totient is φ = 3213123002100.
The previous prime is 3213123002099. The next prime is 3213123002137. The reversal of 3213123002101 is 1012003213123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3211873308900 + 1249693201 = 1792170^2 + 35351^2 .
It is a cyclic number.
It is not a de Polignac number, because 3213123002101 - 21 = 3213123002099 is a prime.
Together with 3213123002099, 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 (3213123005101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1606561501050 + 1606561501051.
It is an arithmetic number, because the mean of its divisors is an integer number (1606561501051).
Almost surely, 23213123002101 is an apocalyptic number.
It is an amenable number.
3213123002101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3213123002101 is an equidigital number, since it uses as much as digits as its factorization.
3213123002101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3213123002101 its reverse (1012003213123), we get a palindrome (4225126215224).
The spelling of 3213123002101 in words is "three trillion, two hundred thirteen billion, one hundred twenty-three million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •