Base | Representation |
---|---|
bin | 1101101001110101000… |
… | …00100011010111010001 |
3 | 1122211220200121001021021 |
4 | 12310322200203113101 |
5 | 30141241030002444 |
6 | 555303341155441 |
7 | 45615361051426 |
oct | 6647240432721 |
9 | 1584820531237 |
10 | 469133047249 |
11 | 170a5a413a99 |
12 | 76b0785bb81 |
13 | 353152902a9 |
14 | 189c59c1d4d |
15 | c30ad59584 |
hex | 6d3a8235d1 |
469133047249 has 2 divisors, whose sum is σ = 469133047250. Its totient is φ = 469133047248.
The previous prime is 469133047219. The next prime is 469133047303. The reversal of 469133047249 is 942740331964.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 327576509649 + 141556537600 = 572343^2 + 376240^2 .
It is a cyclic number.
It is not a de Polignac number, because 469133047249 - 215 = 469133014481 is a prime.
It is a super-2 number, since 2×4691330472492 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 469133047196 and 469133047205.
It is not a weakly prime, because it can be changed into another prime (469133047219) 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, 234566523624 + 234566523625.
It is an arithmetic number, because the mean of its divisors is an integer number (234566523625).
Almost surely, 2469133047249 is an apocalyptic number.
It is an amenable number.
469133047249 is a deficient number, since it is larger than the sum of its proper divisors (1).
469133047249 is an equidigital number, since it uses as much as digits as its factorization.
469133047249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3919104, while the sum is 52.
The spelling of 469133047249 in words is "four hundred sixty-nine billion, one hundred thirty-three million, forty-seven thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •