Base | Representation |
---|---|
bin | 10011000101001101… |
… | …00110011001110101 |
3 | 222102221022022201022 |
4 | 21202212212121311 |
5 | 131440010024113 |
6 | 4412305110525 |
7 | 511601303111 |
oct | 114246463165 |
9 | 28387268638 |
10 | 10244220533 |
11 | 4387660568 |
12 | 1b9a928445 |
13 | c73488371 |
14 | 6d2776741 |
15 | 3ee54e908 |
hex | 2629a6675 |
10244220533 has 8 divisors (see below), whose sum is σ = 10467353088. Its totient is φ = 10021303504.
The previous prime is 10244220529. The next prime is 10244220611. The reversal of 10244220533 is 33502244201.
10244220533 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10244220533 - 22 = 10244220529 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10244223533) 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 in 7 ways as a sum of consecutive naturals, for example, 44135 + ... + 149787.
It is an arithmetic number, because the mean of its divisors is an integer number (1308419136).
Almost surely, 210244220533 is an apocalyptic number.
It is an amenable number.
10244220533 is a deficient number, since it is larger than the sum of its proper divisors (223132555).
10244220533 is a wasteful number, since it uses less digits than its factorization.
10244220533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107763.
The product of its (nonzero) digits is 5760, while the sum is 26.
Adding to 10244220533 its reverse (33502244201), we get a palindrome (43746464734).
The spelling of 10244220533 in words is "ten billion, two hundred forty-four million, two hundred twenty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •