Base | Representation |
---|---|
bin | 100000000000001010… |
… | …101010001010111101 |
3 | 10021200210011111222102 |
4 | 200000022222022331 |
5 | 1030333302020131 |
6 | 23441432154445 |
7 | 2324351464421 |
oct | 400012521275 |
9 | 107623144872 |
10 | 34362532541 |
11 | 13633832327 |
12 | 67abb38a25 |
13 | 331813a1bc |
14 | 193d9acb81 |
15 | d61b111cb |
hex | 8002aa2bd |
34362532541 has 2 divisors, whose sum is σ = 34362532542. Its totient is φ = 34362532540.
The previous prime is 34362532507. The next prime is 34362532543. The reversal of 34362532541 is 14523526343.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33977548900 + 384983641 = 184330^2 + 19621^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34362532541 is a prime.
It is a Sophie Germain prime.
Together with 34362532543, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 34362532495 and 34362532504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34362532543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17181266270 + 17181266271.
It is an arithmetic number, because the mean of its divisors is an integer number (17181266271).
Almost surely, 234362532541 is an apocalyptic number.
It is an amenable number.
34362532541 is a deficient number, since it is larger than the sum of its proper divisors (1).
34362532541 is an equidigital number, since it uses as much as digits as its factorization.
34362532541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 259200, while the sum is 38.
The spelling of 34362532541 in words is "thirty-four billion, three hundred sixty-two million, five hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •