Base | Representation |
---|---|
bin | 10011000010110111… |
… | …00000000011010001 |
3 | 222101120021010110211 |
4 | 21201123200003101 |
5 | 131414440034323 |
6 | 4410323124121 |
7 | 511242050122 |
oct | 114133400321 |
9 | 28346233424 |
10 | 10224533713 |
11 | 4377534569 |
12 | 1b94213641 |
13 | c6c384664 |
14 | 6cdcd0049 |
15 | 3ec96170d |
hex | 2616e00d1 |
10224533713 has 4 divisors (see below), whose sum is σ = 10500872500. Its totient is φ = 9948194928.
The previous prime is 10224533633. The next prime is 10224533717. The reversal of 10224533713 is 31733542201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31733542201 = 17 ⋅1866678953.
It can be written as a sum of positive squares in 2 ways, for example, as 5581882944 + 4642650769 = 74712^2 + 68137^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10224533713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10224533717) 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, 138169338 + ... + 138169411.
It is an arithmetic number, because the mean of its divisors is an integer number (2625218125).
Almost surely, 210224533713 is an apocalyptic number.
It is an amenable number.
10224533713 is a deficient number, since it is larger than the sum of its proper divisors (276338787).
10224533713 is an equidigital number, since it uses as much as digits as its factorization.
10224533713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276338786.
The product of its (nonzero) digits is 15120, while the sum is 31.
The spelling of 10224533713 in words is "ten billion, two hundred twenty-four million, five hundred thirty-three thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •