Base | Representation |
---|---|
bin | 101011101010100101010… |
… | …011000111000100101101 |
3 | 101121212020011222020102122 |
4 | 223222211103013010231 |
5 | 343130323032013312 |
6 | 10214252342402325 |
7 | 426535106521331 |
oct | 53524523070455 |
9 | 11555204866378 |
10 | 3000660422957 |
11 | a5763364427a |
12 | 40566b1303a5 |
13 | 189c655c3112 |
14 | a53388cb7c1 |
15 | 530c26e9b72 |
hex | 2baa54c712d |
3000660422957 has 2 divisors, whose sum is σ = 3000660422958. Its totient is φ = 3000660422956.
The previous prime is 3000660422953. The next prime is 3000660423029. The reversal of 3000660422957 is 7592240660003.
3000660422957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2995180574281 + 5479848676 = 1730659^2 + 74026^2 .
It is an emirp because it is prime and its reverse (7592240660003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3000660422957 - 22 = 3000660422953 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3000660422953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1500330211478 + 1500330211479.
It is an arithmetic number, because the mean of its divisors is an integer number (1500330211479).
Almost surely, 23000660422957 is an apocalyptic number.
It is an amenable number.
3000660422957 is a deficient number, since it is larger than the sum of its proper divisors (1).
3000660422957 is an equidigital number, since it uses as much as digits as its factorization.
3000660422957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320, while the sum is 44.
The spelling of 3000660422957 in words is "three trillion, six hundred sixty million, four hundred twenty-two thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •