Base | Representation |
---|---|
bin | 1001100100000111010111… |
… | …00100101001001111101101 |
3 | 2202110122120001112022102210 |
4 | 10302003223210221033231 |
5 | 10224042231201224401 |
6 | 112422004031041033 |
7 | 4300343226266136 |
oct | 462035344511755 |
9 | 82418501468383 |
10 | 21032112133101 |
11 | 6779739aa1903 |
12 | 24381b7970179 |
13 | b974203bcc64 |
14 | 529d61436c8d |
15 | 2671608884d6 |
hex | 1320eb9293ed |
21032112133101 has 48 divisors (see below), whose sum is σ = 30823895376000. Its totient is φ = 12738567539712.
The previous prime is 21032112133099. The next prime is 21032112133117. The reversal of 21032112133101 is 10133121123012.
It is not a de Polignac number, because 21032112133101 - 21 = 21032112133099 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21032112133171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 109250736 + ... + 109443078.
It is an arithmetic number, because the mean of its divisors is an integer number (642164487000).
Almost surely, 221032112133101 is an apocalyptic number.
It is an amenable number.
21032112133101 is a deficient number, since it is larger than the sum of its proper divisors (9791783242899).
21032112133101 is a wasteful number, since it uses less digits than its factorization.
21032112133101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196758 (or 196741 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 21032112133101 its reverse (10133121123012), we get a palindrome (31165233256113).
The spelling of 21032112133101 in words is "twenty-one trillion, thirty-two billion, one hundred twelve million, one hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •