Base | Representation |
---|---|
bin | 1001100110111111110000… |
… | …11110111111000000111111 |
3 | 2202211010002121010111010201 |
4 | 10303133320132333000333 |
5 | 10232203004412013043 |
6 | 112535255503144331 |
7 | 4310446451630134 |
oct | 463377036770077 |
9 | 82733077114121 |
10 | 21131113001023 |
11 | 6807722447213 |
12 | 2453426ba50a7 |
13 | ba3869c0758c |
14 | 530a738d458b |
15 | 269a07013c4d |
hex | 1337f87bf03f |
21131113001023 has 4 divisors (see below), whose sum is σ = 22374119648160. Its totient is φ = 19888106353888.
The previous prime is 21131113000909. The next prime is 21131113001027. The reversal of 21131113001023 is 32010031113112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21131113001023 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 (21131113001027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 621503323543 + ... + 621503323576.
It is an arithmetic number, because the mean of its divisors is an integer number (5593529912040).
Almost surely, 221131113001023 is an apocalyptic number.
21131113001023 is a deficient number, since it is larger than the sum of its proper divisors (1243006647137).
21131113001023 is a wasteful number, since it uses less digits than its factorization.
21131113001023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1243006647136.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 21131113001023 its reverse (32010031113112), we get a palindrome (53141144114135).
The spelling of 21131113001023 in words is "twenty-one trillion, one hundred thirty-one billion, one hundred thirteen million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •