Base | Representation |
---|---|
bin | 1001100111000011101110… |
… | …11100101010101111010001 |
3 | 2202211022121001021201202121 |
4 | 10303201313130222233101 |
5 | 10232221340213200423 |
6 | 112540251114414241 |
7 | 4310553315314434 |
oct | 463416734525721 |
9 | 82738531251677 |
10 | 21133243100113 |
11 | 6808615873191 |
12 | 2453920431381 |
13 | ba3b19303541 |
14 | 530bd677781b |
15 | 269ace02445d |
hex | 13387772abd1 |
21133243100113 has 2 divisors, whose sum is σ = 21133243100114. Its totient is φ = 21133243100112.
The previous prime is 21133243100107. The next prime is 21133243100237. The reversal of 21133243100113 is 31100134233112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17933090623504 + 3200152476609 = 4234748^2 + 1788897^2 .
It is a cyclic number.
It is not a de Polignac number, because 21133243100113 - 221 = 21133241002961 is a prime.
It is a super-2 number, since 2×211332431001132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21133243100413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10566621550056 + 10566621550057.
It is an arithmetic number, because the mean of its divisors is an integer number (10566621550057).
Almost surely, 221133243100113 is an apocalyptic number.
It is an amenable number.
21133243100113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21133243100113 is an equidigital number, since it uses as much as digits as its factorization.
21133243100113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 21133243100113 its reverse (31100134233112), we get a palindrome (52233377333225).
The spelling of 21133243100113 in words is "twenty-one trillion, one hundred thirty-three billion, two hundred forty-three million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •