Base | Representation |
---|---|
bin | 110001000111010000000… |
… | …111110011100100111101 |
3 | 102221122120102010211110102 |
4 | 301013100013303210331 |
5 | 420244041001101212 |
6 | 11102250014250445 |
7 | 465560443311023 |
oct | 61072007634475 |
9 | 12848512124412 |
10 | 3375041034557 |
11 | 109138a749a05 |
12 | 4661324b6a25 |
13 | 1b635a2a142a |
14 | b94d2354713 |
15 | 5cbd4d735c2 |
hex | 311d01f393d |
3375041034557 has 2 divisors, whose sum is σ = 3375041034558. Its totient is φ = 3375041034556.
The previous prime is 3375041034439. The next prime is 3375041034587. The reversal of 3375041034557 is 7554301405733.
3375041034557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2176861225561 + 1198179808996 = 1475419^2 + 1094614^2 .
It is a cyclic number.
It is not a de Polignac number, because 3375041034557 - 212 = 3375041030461 is a prime.
It is a super-2 number, since 2×33750410345572 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3375041034587) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1687520517278 + 1687520517279.
It is an arithmetic number, because the mean of its divisors is an integer number (1687520517279).
Almost surely, 23375041034557 is an apocalyptic number.
It is an amenable number.
3375041034557 is a deficient number, since it is larger than the sum of its proper divisors (1).
3375041034557 is an equidigital number, since it uses as much as digits as its factorization.
3375041034557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2646000, while the sum is 47.
The spelling of 3375041034557 in words is "three trillion, three hundred seventy-five billion, forty-one million, thirty-four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •