Base | Representation |
---|---|
bin | 101101011100110011001… |
… | …101001010010001000101 |
3 | 102001120210011120010002021 |
4 | 231130303031022101011 |
5 | 402133004334442013 |
6 | 10350454021043141 |
7 | 441436202421541 |
oct | 55346315122105 |
9 | 12046704503067 |
10 | 3123300312133 |
11 | aa4647669191 |
12 | 425396b564b1 |
13 | 1986ab6a8691 |
14 | ab25069aa21 |
15 | 5639e30ea8d |
hex | 2d73334a445 |
3123300312133 has 2 divisors, whose sum is σ = 3123300312134. Its totient is φ = 3123300312132.
The previous prime is 3123300312079. The next prime is 3123300312137. The reversal of 3123300312133 is 3312130033213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2643817464324 + 479482847809 = 1625982^2 + 692447^2 .
It is a cyclic number.
It is not a de Polignac number, because 3123300312133 - 217 = 3123300181061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3123300312098 and 3123300312107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3123300312137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1561650156066 + 1561650156067.
It is an arithmetic number, because the mean of its divisors is an integer number (1561650156067).
Almost surely, 23123300312133 is an apocalyptic number.
It is an amenable number.
3123300312133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3123300312133 is an equidigital number, since it uses as much as digits as its factorization.
3123300312133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 3123300312133 its reverse (3312130033213), we get a palindrome (6435430345346).
The spelling of 3123300312133 in words is "three trillion, one hundred twenty-three billion, three hundred million, three hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •