Base | Representation |
---|---|
bin | 10100011100000001… |
… | …11110000101001101 |
3 | 1001022200210110210012 |
4 | 22032000332011031 |
5 | 134432433203144 |
6 | 5012443523005 |
7 | 535624111016 |
oct | 121600760515 |
9 | 31280713705 |
10 | 10972553549 |
11 | 47207a1981 |
12 | 2162829465 |
13 | 105b337a49 |
14 | 7613a800d |
15 | 44346be9e |
hex | 28e03e14d |
10972553549 has 4 divisors (see below), whose sum is σ = 11020468860. Its totient is φ = 10924638240.
The previous prime is 10972553533. The next prime is 10972553597. The reversal of 10972553549 is 94535527901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94535527901 = 107507 ⋅879343.
It can be written as a sum of positive squares in 2 ways, for example, as 10365276100 + 607277449 = 101810^2 + 24643^2 .
It is a cyclic number.
It is not a de Polignac number, because 10972553549 - 24 = 10972553533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10972553497 and 10972553506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10972553749) 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, 23957312 + ... + 23957769.
It is an arithmetic number, because the mean of its divisors is an integer number (2755117215).
Almost surely, 210972553549 is an apocalyptic number.
It is an amenable number.
10972553549 is a deficient number, since it is larger than the sum of its proper divisors (47915311).
10972553549 is an equidigital number, since it uses as much as digits as its factorization.
10972553549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47915310.
The product of its (nonzero) digits is 1701000, while the sum is 50.
The spelling of 10972553549 in words is "ten billion, nine hundred seventy-two million, five hundred fifty-three thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •