Base | Representation |
---|---|
bin | 111010111010000001… |
… | …101101100110010001 |
3 | 20001021001002000111201 |
4 | 322322001231212101 |
5 | 2014014120200413 |
6 | 45020142511201 |
7 | 4366256555200 |
oct | 727201554621 |
9 | 201231060451 |
10 | 63250553233 |
11 | 2490831989a |
12 | 10312595501 |
13 | 5c70018b7a |
14 | 30c047b237 |
15 | 19a2cd99dd |
hex | eba06d991 |
63250553233 has 6 divisors (see below), whose sum is σ = 73577174226. Its totient is φ = 54214759872.
The previous prime is 63250553227. The next prime is 63250553263. The reversal of 63250553233 is 33235505236.
63250553233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 41163540544 + 22087012689 = 202888^2 + 148617^2 .
It is not a de Polignac number, because 63250553233 - 229 = 62713682321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 63250553192 and 63250553201.
It is not an unprimeable number, because it can be changed into a prime (63250553263) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 645413760 + ... + 645413857.
It is an arithmetic number, because the mean of its divisors is an integer number (12262862371).
Almost surely, 263250553233 is an apocalyptic number.
It is an amenable number.
63250553233 is a deficient number, since it is larger than the sum of its proper divisors (10326620993).
63250553233 is a wasteful number, since it uses less digits than its factorization.
63250553233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1290827631 (or 1290827624 counting only the distinct ones).
The product of its (nonzero) digits is 243000, while the sum is 37.
The spelling of 63250553233 in words is "sixty-three billion, two hundred fifty million, five hundred fifty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •