Base | Representation |
---|---|
bin | 1001100011100000000010… |
… | …11100010100000001110001 |
3 | 2202101122002000020210012202 |
4 | 10301300001130110001301 |
5 | 10223221014034230223 |
6 | 112404153323032545 |
7 | 4265665162023434 |
oct | 461600134240161 |
9 | 82348060223182 |
10 | 21011004211313 |
11 | 6770798137846 |
12 | 24340a696b755 |
13 | b9543831c9cc |
14 | 528d1bd4d81b |
15 | 26682771e428 |
hex | 131c01714071 |
21011004211313 has 8 divisors (see below), whose sum is σ = 22680544276800. Its totient is φ = 19404465657808.
The previous prime is 21011004211289. The next prime is 21011004211361. The reversal of 21011004211313 is 31311240011012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21011004211313 - 216 = 21011004145777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21011004211913) 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, 15750377303 + ... + 15750378636.
It is an arithmetic number, because the mean of its divisors is an integer number (2835068034600).
Almost surely, 221011004211313 is an apocalyptic number.
21011004211313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
21011004211313 is a deficient number, since it is larger than the sum of its proper divisors (1669540065487).
21011004211313 is a wasteful number, since it uses less digits than its factorization.
21011004211313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31500755991.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 21011004211313 its reverse (31311240011012), we get a palindrome (52322244222325).
The spelling of 21011004211313 in words is "twenty-one trillion, eleven billion, four million, two hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •