Base | Representation |
---|---|
bin | 11000010010001010100… |
… | …01110100111100101101 |
3 | 2221202200210101022210202 |
4 | 30021011101310330231 |
5 | 102132310301103103 |
6 | 1435151150443245 |
7 | 114165601416344 |
oct | 14110521647455 |
9 | 2852623338722 |
10 | 834385956653 |
11 | 2a1952135997 |
12 | 115862203525 |
13 | 608b3bc86a2 |
14 | 2c5550b0b5b |
15 | 16a86ecd988 |
hex | c245474f2d |
834385956653 has 2 divisors, whose sum is σ = 834385956654. Its totient is φ = 834385956652.
The previous prime is 834385956643. The next prime is 834385956737. The reversal of 834385956653 is 356659583438.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 732397063204 + 101988893449 = 855802^2 + 319357^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-834385956653 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 834385956653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (834385956623) 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, 417192978326 + 417192978327.
It is an arithmetic number, because the mean of its divisors is an integer number (417192978327).
Almost surely, 2834385956653 is an apocalyptic number.
It is an amenable number.
834385956653 is a deficient number, since it is larger than the sum of its proper divisors (1).
834385956653 is an equidigital number, since it uses as much as digits as its factorization.
834385956653 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 279936000, while the sum is 65.
The spelling of 834385956653 in words is "eight hundred thirty-four billion, three hundred eighty-five million, nine hundred fifty-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •