Base | Representation |
---|---|
bin | 1001100011011110001100… |
… | …11000010101000101010001 |
3 | 2202101112111221200211221202 |
4 | 10301233012120111011101 |
5 | 10223212001401430223 |
6 | 112403511124400545 |
7 | 4265631500353235 |
oct | 461570630250521 |
9 | 82345457624852 |
10 | 21010013311313 |
11 | 6770329869a24 |
12 | 2433a6ab46155 |
13 | b9530ac4a850 |
14 | 528c664d05c5 |
15 | 2667ba739428 |
hex | 131bc6615151 |
21010013311313 has 8 divisors (see below), whose sum is σ = 22626212307048. Its totient is φ = 19393820619264.
The previous prime is 21010013311291. The next prime is 21010013311327. The reversal of 21010013311313 is 31311331001012.
It can be written as a sum of positive squares in 4 ways, for example, as 797507939089 + 20212505372224 = 893033^2 + 4495832^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21010013311313 - 210 = 21010013310289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21010013311913) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7126145 + ... + 9633377.
It is an arithmetic number, because the mean of its divisors is an integer number (2828276538381).
Almost surely, 221010013311313 is an apocalyptic number.
It is an amenable number.
21010013311313 is a deficient number, since it is larger than the sum of its proper divisors (1616198995735).
21010013311313 is a wasteful number, since it uses less digits than its factorization.
21010013311313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3151843.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 21010013311313 its reverse (31311331001012), we get a palindrome (52321344312325).
The spelling of 21010013311313 in words is "twenty-one trillion, ten billion, thirteen million, three hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •