Base | Representation |
---|---|
bin | 101010000110011110… |
… | …110101110101001001 |
3 | 11022200110212220020011 |
4 | 222012132311311021 |
5 | 1220040202422323 |
6 | 32433423231521 |
7 | 3160146564364 |
oct | 520636656511 |
9 | 138613786204 |
10 | 45205904713 |
11 | 18198611332 |
12 | 89174485a1 |
13 | 4355784c58 |
14 | 228bb4b0db |
15 | 1298a6220d |
hex | a867b5d49 |
45205904713 has 2 divisors, whose sum is σ = 45205904714. Its totient is φ = 45205904712.
The previous prime is 45205904707. The next prime is 45205904719. The reversal of 45205904713 is 31740950254.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (45205904707) and next prime (45205904719).
It can be written as a sum of positive squares in only one way, i.e., 28658426944 + 16547477769 = 169288^2 + 128637^2 .
It is a cyclic number.
It is not a de Polignac number, because 45205904713 - 233 = 36615970121 is a prime.
It is a super-2 number, since 2×452059047132 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (45205904719) 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, 22602952356 + 22602952357.
It is an arithmetic number, because the mean of its divisors is an integer number (22602952357).
Almost surely, 245205904713 is an apocalyptic number.
It is an amenable number.
45205904713 is a deficient number, since it is larger than the sum of its proper divisors (1).
45205904713 is an equidigital number, since it uses as much as digits as its factorization.
45205904713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 40.
The spelling of 45205904713 in words is "forty-five billion, two hundred five million, nine hundred four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •