Base | Representation |
---|---|
bin | 111010111010001000… |
… | …111101001110010001 |
3 | 20001021011122111110100 |
4 | 322322020331032101 |
5 | 2014020111432431 |
6 | 45020251323013 |
7 | 4366311654516 |
oct | 727210751621 |
9 | 201234574410 |
10 | 63252452241 |
11 | 249093a6620 |
12 | 10313150469 |
13 | 5c70532344 |
14 | 30c081330d |
15 | 19a30624e6 |
hex | eba23d391 |
63252452241 has 12 divisors (see below), whose sum is σ = 99670530960. Its totient is φ = 38334819480.
The previous prime is 63252452167. The next prime is 63252452251. The reversal of 63252452241 is 14225425236.
63252452241 is a `hidden beast` number, since 63 + 2 + 524 + 52 + 24 + 1 = 666.
It is not a de Polignac number, because 63252452241 - 29 = 63252451729 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 63252452196 and 63252452205.
It is not an unprimeable number, because it can be changed into a prime (63252452251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 319456731 + ... + 319456928.
It is an arithmetic number, because the mean of its divisors is an integer number (8305877580).
Almost surely, 263252452241 is an apocalyptic number.
It is an amenable number.
63252452241 is a deficient number, since it is larger than the sum of its proper divisors (36418078719).
63252452241 is a wasteful number, since it uses less digits than its factorization.
63252452241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 638913676 (or 638913673 counting only the distinct ones).
The product of its digits is 115200, while the sum is 36.
Adding to 63252452241 its reverse (14225425236), we get a palindrome (77477877477).
The spelling of 63252452241 in words is "sixty-three billion, two hundred fifty-two million, four hundred fifty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •