Base | Representation |
---|---|
bin | 10011101001101111… |
… | …00011000000001101 |
3 | 1000020021220200221202 |
4 | 21310313203000031 |
5 | 133101431343231 |
6 | 4502533035245 |
7 | 522312033053 |
oct | 116467430015 |
9 | 30207820852 |
10 | 10550652941 |
11 | 4524628794 |
12 | 2065485b25 |
13 | cc1ac8c0a |
14 | 7213421d3 |
15 | 41b3ce5cb |
hex | 274de300d |
10550652941 has 4 divisors (see below), whose sum is σ = 10551674652. Its totient is φ = 10549631232.
The previous prime is 10550652923. The next prime is 10550652953. The reversal of 10550652941 is 14925605501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4335695716 + 6214957225 = 65846^2 + 78835^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10550652941 is a prime.
It is a super-2 number, since 2×105506529412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10550652895 and 10550652904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10550652961) 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, 495206 + ... + 516071.
It is an arithmetic number, because the mean of its divisors is an integer number (2637918663).
Almost surely, 210550652941 is an apocalyptic number.
It is an amenable number.
10550652941 is a deficient number, since it is larger than the sum of its proper divisors (1021711).
10550652941 is a wasteful number, since it uses less digits than its factorization.
10550652941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1021710.
The product of its (nonzero) digits is 54000, while the sum is 38.
The spelling of 10550652941 in words is "ten billion, five hundred fifty million, six hundred fifty-two thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •