Base | Representation |
---|---|
bin | 1001100110001000010010… |
… | …10101110000010101101101 |
3 | 2202201021020001002020222112 |
4 | 10303010021111300111231 |
5 | 10231211011220220323 |
6 | 112513452340053405 |
7 | 4305343440166400 |
oct | 463041125602555 |
9 | 82637201066875 |
10 | 21101331023213 |
11 | 67a602a285511 |
12 | 24496b5094265 |
13 | ba0b01a698bc |
14 | 52d44a3ddd37 |
15 | 268d62604178 |
hex | 13310957056d |
21101331023213 has 24 divisors (see below), whose sum is σ = 25339108932864. Its totient is φ = 17502826723200.
The previous prime is 21101331023111. The next prime is 21101331023249. The reversal of 21101331023213 is 31232013310112.
It is not a de Polignac number, because 21101331023213 - 226 = 21101263914349 is a prime.
It is a super-2 number, since 2×211013310232132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21101331020213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48956981 + ... + 49386117.
It is an arithmetic number, because the mean of its divisors is an integer number (1055796205536).
Almost surely, 221101331023213 is an apocalyptic number.
It is an amenable number.
21101331023213 is a deficient number, since it is larger than the sum of its proper divisors (4237777909651).
21101331023213 is a wasteful number, since it uses less digits than its factorization.
21101331023213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 461553 (or 461546 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 21101331023213 its reverse (31232013310112), we get a palindrome (52333344333325).
The spelling of 21101331023213 in words is "twenty-one trillion, one hundred one billion, three hundred thirty-one million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •