Base | Representation |
---|---|
bin | 111110010111010011001… |
… | …100101000000011000001 |
3 | 120011200221121211110011021 |
4 | 332113103030220003001 |
5 | 1030203430134241244 |
6 | 13040442251545441 |
7 | 621424541241106 |
oct | 76272314500301 |
9 | 16150847743137 |
10 | 4285625696449 |
11 | 1402583a85959 |
12 | 5926bb45b281 |
13 | 251195903086 |
14 | 10b5d53b2aad |
15 | 7672b74b284 |
hex | 3e5d33280c1 |
4285625696449 has 2 divisors, whose sum is σ = 4285625696450. Its totient is φ = 4285625696448.
The previous prime is 4285625696419. The next prime is 4285625696461. The reversal of 4285625696449 is 9446965265824.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2736427266225 + 1549198430224 = 1654215^2 + 1244668^2 .
It is a cyclic number.
It is not a de Polignac number, because 4285625696449 - 227 = 4285491478721 is a prime.
It is a super-2 number, since 2×42856256964492 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4285625696419) 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, 2142812848224 + 2142812848225.
It is an arithmetic number, because the mean of its divisors is an integer number (2142812848225).
Almost surely, 24285625696449 is an apocalyptic number.
It is an amenable number.
4285625696449 is a deficient number, since it is larger than the sum of its proper divisors (1).
4285625696449 is an equidigital number, since it uses as much as digits as its factorization.
4285625696449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 895795200, while the sum is 70.
The spelling of 4285625696449 in words is "four trillion, two hundred eighty-five billion, six hundred twenty-five million, six hundred ninety-six thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •