Base | Representation |
---|---|
bin | 11000100001110111000… |
… | …10010110101001111001 |
3 | 2222120110001022121120121 |
4 | 30100323202112221321 |
5 | 102302034441421244 |
6 | 1443103243453241 |
7 | 114614451430513 |
oct | 14207342265171 |
9 | 2876401277517 |
10 | 842812451449 |
11 | 2a5486725181 |
12 | 117414227221 |
13 | 616278c8797 |
14 | 2cb14278bb3 |
15 | 16dcbb72c84 |
hex | c43b896a79 |
842812451449 has 2 divisors, whose sum is σ = 842812451450. Its totient is φ = 842812451448.
The previous prime is 842812451447. The next prime is 842812451471. The reversal of 842812451449 is 944154218248.
842812451449 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 465626087424 + 377186364025 = 682368^2 + 614155^2 .
It is a cyclic number.
It is not a de Polignac number, because 842812451449 - 21 = 842812451447 is a prime.
Together with 842812451447, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 842812451396 and 842812451405.
It is not a weakly prime, because it can be changed into another prime (842812451441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 421406225724 + 421406225725.
It is an arithmetic number, because the mean of its divisors is an integer number (421406225725).
Almost surely, 2842812451449 is an apocalyptic number.
It is an amenable number.
842812451449 is a deficient number, since it is larger than the sum of its proper divisors (1).
842812451449 is an equidigital number, since it uses as much as digits as its factorization.
842812451449 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2949120, while the sum is 52.
The spelling of 842812451449 in words is "eight hundred forty-two billion, eight hundred twelve million, four hundred fifty-one thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.368 sec. • engine limits •