Base | Representation |
---|---|
bin | 101011010010111111001… |
… | …000010110001011000101 |
3 | 101112102211110000212000122 |
4 | 223102333020112023011 |
5 | 342221430421130221 |
6 | 10154502303151325 |
7 | 424650205521632 |
oct | 53227710261305 |
9 | 11472743025018 |
10 | 2975324005061 |
11 | a4791191a531 |
12 | 400779ba5545 |
13 | 18775847a875 |
14 | a40139b1189 |
15 | 525dd222eab |
hex | 2b4bf2162c5 |
2975324005061 has 2 divisors, whose sum is σ = 2975324005062. Its totient is φ = 2975324005060.
The previous prime is 2975324005051. The next prime is 2975324005067. The reversal of 2975324005061 is 1605004235792.
2975324005061 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., 2110366344100 + 864957660961 = 1452710^2 + 930031^2 .
It is a cyclic number.
It is not a de Polignac number, because 2975324005061 - 238 = 2700446098117 is a prime.
It is a super-2 number, since 2×29753240050612 (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 (2975324005067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1487662002530 + 1487662002531.
It is an arithmetic number, because the mean of its divisors is an integer number (1487662002531).
Almost surely, 22975324005061 is an apocalyptic number.
It is an amenable number.
2975324005061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2975324005061 is an equidigital number, since it uses as much as digits as its factorization.
2975324005061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 453600, while the sum is 44.
The spelling of 2975324005061 in words is "two trillion, nine hundred seventy-five billion, three hundred twenty-four million, five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •