Base | Representation |
---|---|
bin | 10011110111000100… |
… | …10011100001111101 |
3 | 1000112002102101122022 |
4 | 21323202103201331 |
5 | 133314101300203 |
6 | 4522010525525 |
7 | 525140652605 |
oct | 117342234175 |
9 | 30462371568 |
10 | 10662525053 |
11 | 4581798984 |
12 | 2096a368a5 |
13 | 100c03842b |
14 | 732143c05 |
15 | 42612ba38 |
hex | 27b89387d |
10662525053 has 4 divisors (see below), whose sum is σ = 10690364928. Its totient is φ = 10634685180.
The previous prime is 10662525043. The next prime is 10662525109. The reversal of 10662525053 is 35052526601.
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.
It is a cyclic number.
It is not a de Polignac number, because 10662525053 - 220 = 10661476477 is a prime.
It is a super-2 number, since 2×106625250532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10662525043) 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 3 ways as a sum of consecutive naturals, for example, 13919363 + ... + 13920128.
It is an arithmetic number, because the mean of its divisors is an integer number (2672591232).
Almost surely, 210662525053 is an apocalyptic number.
It is an amenable number.
10662525053 is a deficient number, since it is larger than the sum of its proper divisors (27839875).
10662525053 is an equidigital number, since it uses as much as digits as its factorization.
10662525053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27839874.
The product of its (nonzero) digits is 54000, while the sum is 35.
The spelling of 10662525053 in words is "ten billion, six hundred sixty-two million, five hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •