Base | Representation |
---|---|
bin | 110000110100101011… |
… | …100001100100010101 |
3 | 12000022110221021222222 |
4 | 300310223201210111 |
5 | 1324330344314334 |
6 | 40025532032125 |
7 | 3534046552352 |
oct | 606453414425 |
9 | 160273837888 |
10 | 52423432469 |
11 | 2026172a801 |
12 | a1b0602645 |
13 | 4c35b71235 |
14 | 277452d629 |
15 | 156c4e8d2e |
hex | c34ae1915 |
52423432469 has 2 divisors, whose sum is σ = 52423432470. Its totient is φ = 52423432468.
The previous prime is 52423432421. The next prime is 52423432471. The reversal of 52423432469 is 96423432425.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42209702500 + 10213729969 = 205450^2 + 101063^2 .
It is a cyclic number.
It is not a de Polignac number, because 52423432469 - 28 = 52423432213 is a prime.
It is a super-2 number, since 2×524234324692 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 52423432471, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52423432489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26211716234 + 26211716235.
It is an arithmetic number, because the mean of its divisors is an integer number (26211716235).
Almost surely, 252423432469 is an apocalyptic number.
It is an amenable number.
52423432469 is a deficient number, since it is larger than the sum of its proper divisors (1).
52423432469 is an equidigital number, since it uses as much as digits as its factorization.
52423432469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1244160, while the sum is 44.
Subtracting from 52423432469 its sum of digits (44), we obtain a palindrome (52423432425).
The spelling of 52423432469 in words is "fifty-two billion, four hundred twenty-three million, four hundred thirty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •