Base | Representation |
---|---|
bin | 1001100011001011100011… |
… | …00110110100110011011111 |
3 | 2202100120200011222111022112 |
4 | 10301211301212310303133 |
5 | 10223031000241111221 |
6 | 112355133424304235 |
7 | 4265125414155503 |
oct | 461456146646337 |
9 | 82316604874275 |
10 | 21000001113311 |
11 | 6767061183420 |
12 | 2431b35a7207b |
13 | b943a387c22c |
14 | 5285968b4303 |
15 | 2663d176c15b |
hex | 1319719b4cdf |
21000001113311 has 8 divisors (see below), whose sum is σ = 22920450150864. Its totient is φ = 19081445080320.
The previous prime is 21000001113293. The next prime is 21000001113323. The reversal of 21000001113311 is 11331110000012.
It is a happy number.
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 21000001113311 - 210 = 21000001112287 is a prime.
It is a super-2 number, since 2×210000011133112 (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 (21000001113361) 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, 473227940 + ... + 473272313.
It is an arithmetic number, because the mean of its divisors is an integer number (2865056268858).
Almost surely, 221000001113311 is an apocalyptic number.
21000001113311 is a deficient number, since it is larger than the sum of its proper divisors (1920449037553).
21000001113311 is a wasteful number, since it uses less digits than its factorization.
21000001113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946502281.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 21000001113311 its reverse (11331110000012), we get a palindrome (32331111113323).
The spelling of 21000001113311 in words is "twenty-one trillion, one million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •