Base | Representation |
---|---|
bin | 1001001101110010101010… |
… | …0000101011010110110101 |
3 | 1022212122212012121202012021 |
4 | 2103130222200223112311 |
5 | 2312002421002414113 |
6 | 33314454115553141 |
7 | 2064023545643353 |
oct | 223345240532665 |
9 | 38778765552167 |
10 | 10132541060533 |
11 | 3257206301581 |
12 | 11779075bb7b1 |
13 | 586657607968 |
14 | 2705bbc967d3 |
15 | 128885de348d |
hex | 9372a82b5b5 |
10132541060533 has 16 divisors (see below), whose sum is σ = 10611150584832. Its totient is φ = 9663531696000.
The previous prime is 10132541060531. The next prime is 10132541060617. The reversal of 10132541060533 is 33506014523101.
10132541060533 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10132541060533 - 21 = 10132541060531 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132541060531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4305103 + ... + 6228883.
It is an arithmetic number, because the mean of its divisors is an integer number (663196911552).
Almost surely, 210132541060533 is an apocalyptic number.
It is an amenable number.
10132541060533 is a deficient number, since it is larger than the sum of its proper divisors (478609524299).
10132541060533 is a wasteful number, since it uses less digits than its factorization.
10132541060533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1926276.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 10132541060533 its reverse (33506014523101), we get a palindrome (43638555583634).
The spelling of 10132541060533 in words is "ten trillion, one hundred thirty-two billion, five hundred forty-one million, sixty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •