Base | Representation |
---|---|
bin | 1101101001110001101… |
… | …00000010100101101101 |
3 | 1122211211201001211222021 |
4 | 12310320310002211231 |
5 | 30141211234221303 |
6 | 555300443350141 |
7 | 45614564215165 |
oct | 6647064024555 |
9 | 1584751054867 |
10 | 469104601453 |
11 | 170a45355274 |
12 | 76aba222351 |
13 | 3530c410867 |
14 | 189c1cd95a5 |
15 | c3085daebd |
hex | 6d38d0296d |
469104601453 has 2 divisors, whose sum is σ = 469104601454. Its totient is φ = 469104601452.
The previous prime is 469104601447. The next prime is 469104601481. The reversal of 469104601453 is 354106401964.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 254784676644 + 214319924809 = 504762^2 + 462947^2 .
It is a cyclic number.
It is not a de Polignac number, because 469104601453 - 213 = 469104593261 is a prime.
It is a super-2 number, since 2×4691046014532 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (469104631453) 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, 234552300726 + 234552300727.
It is an arithmetic number, because the mean of its divisors is an integer number (234552300727).
Almost surely, 2469104601453 is an apocalyptic number.
It is an amenable number.
469104601453 is a deficient number, since it is larger than the sum of its proper divisors (1).
469104601453 is an equidigital number, since it uses as much as digits as its factorization.
469104601453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 43.
The spelling of 469104601453 in words is "four hundred sixty-nine billion, one hundred four million, six hundred one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •