Base | Representation |
---|---|
bin | 1001100100101010101100… |
… | …1010001010011000111101 |
3 | 1101021020021002011201020012 |
4 | 2121022223022022120331 |
5 | 2334422302102140013 |
6 | 34215211134033005 |
7 | 2134305505040513 |
oct | 231125312123075 |
9 | 41236232151205 |
10 | 10525541443133 |
11 | 3398947820802 |
12 | 121bb06648765 |
13 | 5b4728a45252 |
14 | 28562059c4b3 |
15 | 133bd804b1a8 |
hex | 992ab28a63d |
10525541443133 has 32 divisors (see below), whose sum is σ = 10817319052800. Its totient is φ = 10238396737536.
The previous prime is 10525541443127. The next prime is 10525541443163. The reversal of 10525541443133 is 33134414552501.
It is a cyclic number.
It is not a de Polignac number, because 10525541443133 - 230 = 10524467701309 is a prime.
It is a super-2 number, since 2×105255414431332 (a number of 27 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 (10525541443163) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8053206266 + ... + 8053207572.
It is an arithmetic number, because the mean of its divisors is an integer number (338041220400).
Almost surely, 210525541443133 is an apocalyptic number.
It is an amenable number.
10525541443133 is a deficient number, since it is larger than the sum of its proper divisors (291777609667).
10525541443133 is a wasteful number, since it uses less digits than its factorization.
10525541443133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3701.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 10525541443133 its reverse (33134414552501), we get a palindrome (43659955995634).
The spelling of 10525541443133 in words is "ten trillion, five hundred twenty-five billion, five hundred forty-one million, four hundred forty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •