Base | Representation |
---|---|
bin | 111110001111101000101… |
… | …010101011010111111101 |
3 | 120010220201002010120221021 |
4 | 332033220222223113331 |
5 | 1030040101331230331 |
6 | 13033001504104141 |
7 | 621013600530226 |
oct | 76175052532775 |
9 | 16126632116837 |
10 | 4277395961341 |
11 | 13aa040566088 |
12 | 590ba3305051 |
13 | 2504838c4429 |
14 | 10b0543c624d |
15 | 763e8ec1211 |
hex | 3e3e8aab5fd |
4277395961341 has 2 divisors, whose sum is σ = 4277395961342. Its totient is φ = 4277395961340.
The previous prime is 4277395961303. The next prime is 4277395961393. The reversal of 4277395961341 is 1431695937724.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4232524436100 + 44871525241 = 2057310^2 + 211829^2 .
It is a cyclic number.
It is not a de Polignac number, because 4277395961341 - 221 = 4277393864189 is a prime.
It is a super-2 number, since 2×42773959613412 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4277395961341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4277395961141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2138697980670 + 2138697980671.
It is an arithmetic number, because the mean of its divisors is an integer number (2138697980671).
Almost surely, 24277395961341 is an apocalyptic number.
It is an amenable number.
4277395961341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4277395961341 is an equidigital number, since it uses as much as digits as its factorization.
4277395961341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34292160, while the sum is 61.
The spelling of 4277395961341 in words is "four trillion, two hundred seventy-seven billion, three hundred ninety-five million, nine hundred sixty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •