Base | Representation |
---|---|
bin | 101101011010111101110… |
… | …001110100010101010101 |
3 | 102001101200212110120012112 |
4 | 231122331301310111111 |
5 | 402114441013211013 |
6 | 10345530323000405 |
7 | 441336321012122 |
oct | 55327561642525 |
9 | 12041625416175 |
10 | 3121330210133 |
11 | aa3826592413 |
12 | 424b27209105 |
13 | 19845649ba55 |
14 | ab104b85749 |
15 | 562d63a5ba8 |
hex | 2d6bdc74555 |
3121330210133 has 2 divisors, whose sum is σ = 3121330210134. Its totient is φ = 3121330210132.
The previous prime is 3121330210109. The next prime is 3121330210147. The reversal of 3121330210133 is 3310120331213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3013498099249 + 107832110884 = 1735943^2 + 328378^2 .
It is a cyclic number.
It is not a de Polignac number, because 3121330210133 - 214 = 3121330193749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3121330210099 and 3121330210108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3121330216133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560665105066 + 1560665105067.
It is an arithmetic number, because the mean of its divisors is an integer number (1560665105067).
Almost surely, 23121330210133 is an apocalyptic number.
It is an amenable number.
3121330210133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121330210133 is an equidigital number, since it uses as much as digits as its factorization.
3121330210133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 3121330210133 its reverse (3310120331213), we get a palindrome (6431450541346).
The spelling of 3121330210133 in words is "three trillion, one hundred twenty-one billion, three hundred thirty million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •