Base | Representation |
---|---|
bin | 1001100011100011111110… |
… | …00100111011111000001101 |
3 | 2202101211111220110011121000 |
4 | 10301301333010323320031 |
5 | 10223234323133343201 |
6 | 112405142420330513 |
7 | 4266101335031013 |
oct | 461617704737015 |
9 | 82354456404530 |
10 | 21013112012301 |
11 | 6771679a13932 |
12 | 2434594843a39 |
13 | b956b2c0c526 |
14 | 52907bc6a8b3 |
15 | 2668ec7c7d86 |
hex | 131c7f13be0d |
21013112012301 has 8 divisors (see below), whose sum is σ = 31130536314560. Its totient is φ = 14008741341516.
The previous prime is 21013112012293. The next prime is 21013112012359. The reversal of 21013112012301 is 10321021131012.
21013112012301 is a `hidden beast` number, since 2 + 101 + 311 + 20 + 1 + 230 + 1 = 666.
It is not a de Polignac number, because 21013112012301 - 23 = 21013112012293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21013112010301) 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, 389131703905 + ... + 389131703958.
It is an arithmetic number, because the mean of its divisors is an integer number (3891317039320).
Almost surely, 221013112012301 is an apocalyptic number.
It is an amenable number.
21013112012301 is a deficient number, since it is larger than the sum of its proper divisors (10117424302259).
21013112012301 is an equidigital number, since it uses as much as digits as its factorization.
21013112012301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778263407872 (or 778263407866 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 21013112012301 its reverse (10321021131012), we get a palindrome (31334133143313).
The spelling of 21013112012301 in words is "twenty-one trillion, thirteen billion, one hundred twelve million, twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •