Base | Representation |
---|---|
bin | 101011010010111100011… |
… | …110110001110001000001 |
3 | 101112102201100101111002021 |
4 | 223102330132301301001 |
5 | 342221333031203401 |
6 | 10154454034321441 |
7 | 424646125633555 |
oct | 53227436616101 |
9 | 11472640344067 |
10 | 2975279553601 |
11 | a47899819493 |
12 | 400767129281 |
13 | 18774c1b5b24 |
14 | a400bb1d865 |
15 | 525d93922a1 |
hex | 2b4bc7b1c41 |
2975279553601 has 2 divisors, whose sum is σ = 2975279553602. Its totient is φ = 2975279553600.
The previous prime is 2975279553563. The next prime is 2975279553611. The reversal of 2975279553601 is 1063559725792.
2975279553601 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., 1533176386225 + 1442103167376 = 1238215^2 + 1200876^2 .
It is a cyclic number.
It is not a de Polignac number, because 2975279553601 - 215 = 2975279520833 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2975279553601.
It is not a weakly prime, because it can be changed into another prime (2975279553611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1487639776800 + 1487639776801.
It is an arithmetic number, because the mean of its divisors is an integer number (1487639776801).
Almost surely, 22975279553601 is an apocalyptic number.
It is an amenable number.
2975279553601 is a deficient number, since it is larger than the sum of its proper divisors (1).
2975279553601 is an equidigital number, since it uses as much as digits as its factorization.
2975279553601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35721000, while the sum is 61.
The spelling of 2975279553601 in words is "two trillion, nine hundred seventy-five billion, two hundred seventy-nine million, five hundred fifty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •