Base | Representation |
---|---|
bin | 1001100101110001100000… |
… | …1010011110001110100001 |
3 | 1101100001022211100001020011 |
4 | 2121130120022132032201 |
5 | 2340230214312010423 |
6 | 34232033251444521 |
7 | 2135550532041625 |
oct | 231343012361641 |
9 | 41301284301204 |
10 | 10544550110113 |
11 | 33a5a11706638 |
12 | 12237305b6741 |
13 | 5b6467c288a6 |
14 | 286504d51185 |
15 | 13444bc48b0d |
hex | 9971829e3a1 |
10544550110113 has 8 divisors (see below), whose sum is σ = 10852467343200. Its totient is φ = 10240939411968.
The previous prime is 10544550109969. The next prime is 10544550110131. The reversal of 10544550110113 is 31101105544501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10544550110113 - 225 = 10544516555681 is a prime.
It is a super-2 number, since 2×105445501101132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10544550110173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1076628768 + ... + 1076638561.
It is an arithmetic number, because the mean of its divisors is an integer number (1356558417900).
Almost surely, 210544550110113 is an apocalyptic number.
It is an amenable number.
10544550110113 is a deficient number, since it is larger than the sum of its proper divisors (307917233087).
10544550110113 is an equidigital number, since it uses as much as digits as its factorization.
10544550110113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2153267471.
The product of its (nonzero) digits is 6000, while the sum is 31.
Adding to 10544550110113 its reverse (31101105544501), we get a palindrome (41645655654614).
The spelling of 10544550110113 in words is "ten trillion, five hundred forty-four billion, five hundred fifty million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •