Base | Representation |
---|---|
bin | 1001100110011110000001… |
… | …11100011010111001000101 |
3 | 2202202101100100210222011202 |
4 | 10303033000330122321011 |
5 | 10231403411314332401 |
6 | 112523102351112245 |
7 | 4306235566130261 |
oct | 463170074327105 |
9 | 82671310728152 |
10 | 21113001324101 |
11 | 67aaa78918285 |
12 | 244ba11512685 |
13 | ba1c4180559b |
14 | 52dc363170a1 |
15 | 2692e6e4b06b |
hex | 1333c0f1ae45 |
21113001324101 has 2 divisors, whose sum is σ = 21113001324102. Its totient is φ = 21113001324100.
The previous prime is 21113001324073. The next prime is 21113001324221. The reversal of 21113001324101 is 10142310031112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15352996524100 + 5760004800001 = 3918290^2 + 2400001^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21113001324101 is a prime.
It is a super-2 number, since 2×211130013241012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21113001327101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556500662050 + 10556500662051.
It is an arithmetic number, because the mean of its divisors is an integer number (10556500662051).
Almost surely, 221113001324101 is an apocalyptic number.
It is an amenable number.
21113001324101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21113001324101 is an equidigital number, since it uses as much as digits as its factorization.
21113001324101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 21113001324101 its reverse (10142310031112), we get a palindrome (31255311355213).
The spelling of 21113001324101 in words is "twenty-one trillion, one hundred thirteen billion, one million, three hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •