Base | Representation |
---|---|
bin | 1001100011110110101000… |
… | …10001011111110011000111 |
3 | 2202102210101011111212201211 |
4 | 10301323110101133303013 |
5 | 10223420333103144421 |
6 | 112413520532432251 |
7 | 4266604535426260 |
oct | 461732421376307 |
9 | 82383334455654 |
10 | 21023131303111 |
11 | 6775950604363 |
12 | 2436510178687 |
13 | b9661b8c2382 |
14 | 52974c7b1967 |
15 | 266cd71e69e1 |
hex | 131ed445fcc7 |
21023131303111 has 8 divisors (see below), whose sum is σ = 24027746764320. Its totient is φ = 18018843589248.
The previous prime is 21023131303103. The next prime is 21023131303121. The reversal of 21023131303111 is 11130313132012.
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 21023131303111 - 23 = 21023131303103 is a prime.
It is a super-2 number, since 2×210231313031112 (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 (21023131303121) 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, 81799366 + ... + 82055971.
It is an arithmetic number, because the mean of its divisors is an integer number (3003468345540).
Almost surely, 221023131303111 is an apocalyptic number.
21023131303111 is a deficient number, since it is larger than the sum of its proper divisors (3004615461209).
21023131303111 is a wasteful number, since it uses less digits than its factorization.
21023131303111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163873673.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 21023131303111 its reverse (11130313132012), we get a palindrome (32153444435123).
The spelling of 21023131303111 in words is "twenty-one trillion, twenty-three billion, one hundred thirty-one million, three hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •