Base | Representation |
---|---|
bin | 111110000000010111001… |
… | …010000001101000111101 |
3 | 120002100101010211101000222 |
4 | 332000113022001220331 |
5 | 1024303004442434012 |
6 | 13021250301231125 |
7 | 616563311634011 |
oct | 76002712015075 |
9 | 16070333741028 |
10 | 4260996061757 |
11 | 13a3095213866 |
12 | 589986b624a5 |
13 | 24ba6c033536 |
14 | 10a33a2b8541 |
15 | 75c89336972 |
hex | 3e017281a3d |
4260996061757 has 2 divisors, whose sum is σ = 4260996061758. Its totient is φ = 4260996061756.
The previous prime is 4260996061687. The next prime is 4260996061783. The reversal of 4260996061757 is 7571606990624.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3548830539556 + 712165522201 = 1883834^2 + 843899^2 .
It is a cyclic number.
It is not a de Polignac number, because 4260996061757 - 28 = 4260996061501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4260996061757.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4260936061757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2130498030878 + 2130498030879.
It is an arithmetic number, because the mean of its divisors is an integer number (2130498030879).
Almost surely, 24260996061757 is an apocalyptic number.
It is an amenable number.
4260996061757 is a deficient number, since it is larger than the sum of its proper divisors (1).
4260996061757 is an equidigital number, since it uses as much as digits as its factorization.
4260996061757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34292160, while the sum is 62.
The spelling of 4260996061757 in words is "four trillion, two hundred sixty billion, nine hundred ninety-six million, sixty-one thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •