Base | Representation |
---|---|
bin | 110000011110010110011… |
… | …001111000000100000101 |
3 | 102210110012200122112110001 |
4 | 300132112121320010011 |
5 | 414034114443120122 |
6 | 11030144035001301 |
7 | 462444222326251 |
oct | 60362631700405 |
9 | 12713180575401 |
10 | 3331123020037 |
11 | 10747a311463a |
12 | 459716439231 |
13 | 1b217b5a44a7 |
14 | b7327695261 |
15 | 5b9b440d527 |
hex | 30796678105 |
3331123020037 has 2 divisors, whose sum is σ = 3331123020038. Its totient is φ = 3331123020036.
The previous prime is 3331123019839. The next prime is 3331123020053. The reversal of 3331123020037 is 7300203211333.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1999393172001 + 1331729848036 = 1413999^2 + 1154006^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3331123020037 is a prime.
It is a super-2 number, since 2×33311230200372 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3331123019987 and 3331123020014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3331123020097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1665561510018 + 1665561510019.
It is an arithmetic number, because the mean of its divisors is an integer number (1665561510019).
Almost surely, 23331123020037 is an apocalyptic number.
It is an amenable number.
3331123020037 is a deficient number, since it is larger than the sum of its proper divisors (1).
3331123020037 is an equidigital number, since it uses as much as digits as its factorization.
3331123020037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6804, while the sum is 28.
The spelling of 3331123020037 in words is "three trillion, three hundred thirty-one billion, one hundred twenty-three million, twenty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •