Base | Representation |
---|---|
bin | 1111000110001… |
… | …1010010011001 |
3 | 11102011001102011 |
4 | 3301203102121 |
5 | 112202234431 |
6 | 10141105521 |
7 | 1366136014 |
oct | 361432231 |
9 | 142131364 |
10 | 63321241 |
11 | 3281a205 |
12 | 192582a1 |
13 | 101708b9 |
14 | 85a437b |
15 | 585bcb1 |
hex | 3c63499 |
63321241 has 4 divisors (see below), whose sum is σ = 64793872. Its totient is φ = 61848612.
The previous prime is 63321217. The next prime is 63321253. The reversal of 63321241 is 14212336.
63321241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 63321241 - 27 = 63321113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (63321211) 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 in 3 ways as a sum of consecutive naturals, for example, 736251 + ... + 736336.
It is an arithmetic number, because the mean of its divisors is an integer number (16198468).
Almost surely, 263321241 is an apocalyptic number.
It is an amenable number.
63321241 is a deficient number, since it is larger than the sum of its proper divisors (1472631).
63321241 is a wasteful number, since it uses less digits than its factorization.
63321241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472630.
The product of its digits is 864, while the sum is 22.
The square root of 63321241 is about 7957.4644831127. The cubic root of 63321241 is about 398.5808900211.
Adding to 63321241 its reverse (14212336), we get a palindrome (77533577).
The spelling of 63321241 in words is "sixty-three million, three hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •