Base | Representation |
---|---|
bin | 101010011111000… |
… | …1111101110011001 |
3 | 10200100112011022221 |
4 | 1110332033232121 |
5 | 10404423302411 |
6 | 353243344041 |
7 | 50220300241 |
oct | 12476175631 |
9 | 3610464287 |
10 | 1425603481 |
11 | 671796aa5 |
12 | 339522021 |
13 | 199474573 |
14 | d7498b21 |
15 | 85251071 |
hex | 54f8fb99 |
1425603481 has 2 divisors, whose sum is σ = 1425603482. Its totient is φ = 1425603480.
The previous prime is 1425603463. The next prime is 1425603511. The reversal of 1425603481 is 1843065241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 794337856 + 631265625 = 28184^2 + 25125^2 .
It is an emirp because it is prime and its reverse (1843065241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1425603481 - 219 = 1425079193 is a prime.
It is a super-2 number, since 2×14256034812 = 4064690570078634722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1425603461) 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, 712801740 + 712801741.
It is an arithmetic number, because the mean of its divisors is an integer number (712801741).
Almost surely, 21425603481 is an apocalyptic number.
It is an amenable number.
1425603481 is a deficient number, since it is larger than the sum of its proper divisors (1).
1425603481 is an equidigital number, since it uses as much as digits as its factorization.
1425603481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 34.
The square root of 1425603481 is about 37757.1646313650. The cubic root of 1425603481 is about 1125.4673892662.
The spelling of 1425603481 in words is "one billion, four hundred twenty-five million, six hundred three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •