Base | Representation |
---|---|
bin | 1110110101111… |
… | …1001110101001 |
3 | 11100010221020022 |
4 | 3231133032221 |
5 | 111414143131 |
6 | 10102210225 |
7 | 1354111331 |
oct | 355371651 |
9 | 140127208 |
10 | 62256041 |
11 | 32161981 |
12 | 18a23975 |
13 | cb89ac3 |
14 | 83a80c1 |
15 | 56eb37b |
hex | 3b5f3a9 |
62256041 has 2 divisors, whose sum is σ = 62256042. Its totient is φ = 62256040.
The previous prime is 62255993. The next prime is 62256043. The reversal of 62256041 is 14065226.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33408400 + 28847641 = 5780^2 + 5371^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-62256041 is a prime.
It is a Sophie Germain prime.
Together with 62256043, it forms a pair of twin primes.
It is a Chen 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 62256041.
It is not a weakly prime, because it can be changed into another prime (62256043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31128020 + 31128021.
It is an arithmetic number, because the mean of its divisors is an integer number (31128021).
Almost surely, 262256041 is an apocalyptic number.
It is an amenable number.
62256041 is a deficient number, since it is larger than the sum of its proper divisors (1).
62256041 is an equidigital number, since it uses as much as digits as its factorization.
62256041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 62256041 is about 7890.2497425620. The cubic root of 62256041 is about 396.3332420062. Note that the first 3 decimals are identical.
The spelling of 62256041 in words is "sixty-two million, two hundred fifty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •