Base | Representation |
---|---|
bin | 1001101010111001001110… |
… | …0111000001000001000101 |
3 | 1101122110101122012201020211 |
4 | 2122232103213001001011 |
5 | 2343200400224124013 |
6 | 34340302411155421 |
7 | 2145113525241106 |
oct | 232562347010105 |
9 | 41573348181224 |
10 | 10632520536133 |
11 | 342a254720761 |
12 | 12387a1745b71 |
13 | 5c184741a702 |
14 | 28a88c4963ad |
15 | 136899d2023d |
hex | 9ab939c1045 |
10632520536133 has 48 divisors (see below), whose sum is σ = 12131059248000. Its totient is φ = 9281418943104.
The previous prime is 10632520536119. The next prime is 10632520536139. The reversal of 10632520536133 is 33163502523601.
It is not a de Polignac number, because 10632520536133 - 29 = 10632520535621 is a prime.
It is a super-2 number, since 2×106325205361332 (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 (10632520536139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 127917735 + ... + 128000827.
It is an arithmetic number, because the mean of its divisors is an integer number (252730401000).
Almost surely, 210632520536133 is an apocalyptic number.
It is an amenable number.
10632520536133 is a deficient number, since it is larger than the sum of its proper divisors (1498538711867).
10632520536133 is a wasteful number, since it uses less digits than its factorization.
10632520536133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83626 (or 83603 counting only the distinct ones).
The product of its (nonzero) digits is 291600, while the sum is 40.
The spelling of 10632520536133 in words is "ten trillion, six hundred thirty-two billion, five hundred twenty million, five hundred thirty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •