Base | Representation |
---|---|
bin | 1001101010010000000110… |
… | …0110111011110100101100 |
3 | 1101121101220021120121001020 |
4 | 2122210001212323310230 |
5 | 2343010243130403412 |
6 | 34331235134014140 |
7 | 2144243126524536 |
oct | 232440146736454 |
9 | 41541807517036 |
10 | 10621481106732 |
11 | 34255aa201a91 |
12 | 1236620647350 |
13 | 5c07a8299172 |
14 | 28a122280856 |
15 | 136450a9318c |
hex | 9a9019bbd2c |
10621481106732 has 12 divisors (see below), whose sum is σ = 24783455915736. Its totient is φ = 3540493702240.
The previous prime is 10621481106697. The next prime is 10621481106773. The reversal of 10621481106732 is 23760118412601.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×106214811067322 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 442561712769 + ... + 442561712792.
It is an arithmetic number, because the mean of its divisors is an integer number (2065287992978).
Almost surely, 210621481106732 is an apocalyptic number.
10621481106732 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10621481106732 is an abundant number, since it is smaller than the sum of its proper divisors (14161974809004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10621481106732 is a wasteful number, since it uses less digits than its factorization.
10621481106732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 885123425568 (or 885123425566 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 42.
The spelling of 10621481106732 in words is "ten trillion, six hundred twenty-one billion, four hundred eighty-one million, one hundred six thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •