Base | Representation |
---|---|
bin | 1010011110101010… |
… | …10011100110110101 |
3 | 112112002020000020021 |
4 | 11033111103212311 |
5 | 43010220441233 |
6 | 2330131405141 |
7 | 256262544304 |
oct | 51725234665 |
9 | 15462200207 |
10 | 5625952693 |
11 | 2427781589 |
12 | 11101537b1 |
13 | 6b87431ba |
14 | 3b528243b |
15 | 22dd9de2d |
hex | 14f5539b5 |
5625952693 has 2 divisors, whose sum is σ = 5625952694. Its totient is φ = 5625952692.
The previous prime is 5625952667. The next prime is 5625952721. The reversal of 5625952693 is 3962595265.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5192355364 + 433597329 = 72058^2 + 20823^2 .
It is a cyclic number.
It is not a de Polignac number, because 5625952693 - 29 = 5625952181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5625952693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5625952603) 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, 2812976346 + 2812976347.
It is an arithmetic number, because the mean of its divisors is an integer number (2812976347).
Almost surely, 25625952693 is an apocalyptic number.
It is an amenable number.
5625952693 is a deficient number, since it is larger than the sum of its proper divisors (1).
5625952693 is an equidigital number, since it uses as much as digits as its factorization.
5625952693 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4374000, while the sum is 52.
The square root of 5625952693 is about 75006.3510177638. The cubic root of 5625952693 is about 1778.5470503506.
The spelling of 5625952693 in words is "five billion, six hundred twenty-five million, nine hundred fifty-two thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •