Base | Representation |
---|---|
bin | 1001100110011110000100… |
… | …00011101100111101001001 |
3 | 2202202101101122222022211200 |
4 | 10303033002003230331021 |
5 | 10231403431110312223 |
6 | 112523104255414413 |
7 | 4306236214015110 |
oct | 463170203547511 |
9 | 82671348868750 |
10 | 21113020010313 |
11 | 67aaa88420530 |
12 | 244ba17824409 |
13 | ba1c45648a0a |
14 | 52dc389bcc77 |
15 | 2692e88dca43 |
hex | 1333c20ecf49 |
21113020010313 has 48 divisors (see below), whose sum is σ = 39248222687232. Its totient is φ = 10614002508000.
The previous prime is 21113020010309. The next prime is 21113020010429. The reversal of 21113020010313 is 31301002031112.
21113020010313 is a `hidden beast` number, since 2 + 11 + 130 + 200 + 10 + 313 = 666.
It is not a de Polignac number, because 21113020010313 - 22 = 21113020010309 is a prime.
It is a super-2 number, since 2×211130200103132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21113020010213) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 491367523 + ... + 491410488.
It is an arithmetic number, because the mean of its divisors is an integer number (817671305984).
Almost surely, 221113020010313 is an apocalyptic number.
It is an amenable number.
21113020010313 is a deficient number, since it is larger than the sum of its proper divisors (18135202676919).
21113020010313 is a wasteful number, since it uses less digits than its factorization.
21113020010313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 982778066 (or 982778063 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 21113020010313 its reverse (31301002031112), we get a palindrome (52414022041425).
The spelling of 21113020010313 in words is "twenty-one trillion, one hundred thirteen billion, twenty million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •