Base | Representation |
---|---|
bin | 10100000001110000… |
… | …00011101101111101 |
3 | 1000202022222221221011 |
4 | 22000320003231331 |
5 | 134010020113113 |
6 | 4534531035221 |
7 | 530306312530 |
oct | 120070035575 |
9 | 30668887834 |
10 | 10752113533 |
11 | 4618319047 |
12 | 2100a3bb11 |
13 | 1024774c75 |
14 | 73ddc4a17 |
15 | 42de2663d |
hex | 280e03b7d |
10752113533 has 4 divisors (see below), whose sum is σ = 12288129760. Its totient is φ = 9216097308.
The previous prime is 10752113527. The next prime is 10752113557. The reversal of 10752113533 is 33531125701.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33531125701 = 102547 ⋅326983.
It is a cyclic number.
It is not a de Polignac number, because 10752113533 - 213 = 10752105341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10752113495 and 10752113504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10752113503) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 768008103 + ... + 768008116.
It is an arithmetic number, because the mean of its divisors is an integer number (3072032440).
Almost surely, 210752113533 is an apocalyptic number.
It is an amenable number.
10752113533 is a deficient number, since it is larger than the sum of its proper divisors (1536016227).
10752113533 is an equidigital number, since it uses as much as digits as its factorization.
10752113533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1536016226.
The product of its (nonzero) digits is 9450, while the sum is 31.
The spelling of 10752113533 in words is "ten billion, seven hundred fifty-two million, one hundred thirteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •