Base | Representation |
---|---|
bin | 111101011001110110111010… |
… | …010101100100011100000001 |
3 | 1022102012021100100201020101112 |
4 | 331121312322111210130001 |
5 | 240344111320412341131 |
6 | 2354210500023413105 |
7 | 110612013443363144 |
oct | 7531667225443401 |
9 | 1272167310636345 |
10 | 270057784887041 |
11 | 790599551a4368 |
12 | 263570118b4195 |
13 | b78c45582c528 |
14 | 4a98c1ba8a05b |
15 | 2134c51ad302b |
hex | f59dba564701 |
270057784887041 has 2 divisors, whose sum is σ = 270057784887042. Its totient is φ = 270057784887040.
The previous prime is 270057784887031. The next prime is 270057784887083. The reversal of 270057784887041 is 140788487750072.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 265954810550641 + 4102974336400 = 16308121^2 + 2025580^2 .
It is a cyclic number.
It is not a de Polignac number, because 270057784887041 - 218 = 270057784624897 is a prime.
It is a super-2 number, since 2×2700577848870412 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (270057784887031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 135028892443520 + 135028892443521.
It is an arithmetic number, because the mean of its divisors is an integer number (135028892443521).
Almost surely, 2270057784887041 is an apocalyptic number.
It is an amenable number.
270057784887041 is a deficient number, since it is larger than the sum of its proper divisors (1).
270057784887041 is an equidigital number, since it uses as much as digits as its factorization.
270057784887041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 196689920, while the sum is 68.
The spelling of 270057784887041 in words is "two hundred seventy trillion, fifty-seven billion, seven hundred eighty-four million, eight hundred eighty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •