Base | Representation |
---|---|
bin | 1111001000000… |
… | …0100111110101 |
3 | 11102101011020101 |
4 | 3302000213311 |
5 | 112220111042 |
6 | 10143434101 |
7 | 1400146225 |
oct | 362004765 |
9 | 142334211 |
10 | 63441397 |
11 | 328a1508 |
12 | 192b5931 |
13 | 101b34b6 |
14 | 85d6085 |
15 | 58826b7 |
hex | 3c809f5 |
63441397 has 2 divisors, whose sum is σ = 63441398. Its totient is φ = 63441396.
The previous prime is 63441377. The next prime is 63441419. The reversal of 63441397 is 79314436.
63441397 is nontrivially palindromic in base 6.
63441397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62583921 + 857476 = 7911^2 + 926^2 .
It is a cyclic number.
It is not a de Polignac number, because 63441397 - 215 = 63408629 is a prime.
It is a super-3 number, since 3×634413973 (a number of 24 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (63441317) 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, 31720698 + 31720699.
It is an arithmetic number, because the mean of its divisors is an integer number (31720699).
Almost surely, 263441397 is an apocalyptic number.
It is an amenable number.
63441397 is a deficient number, since it is larger than the sum of its proper divisors (1).
63441397 is an equidigital number, since it uses as much as digits as its factorization.
63441397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54432, while the sum is 37.
The square root of 63441397 is about 7965.0107972306. The cubic root of 63441397 is about 398.8328414145.
The spelling of 63441397 in words is "sixty-three million, four hundred forty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •