Base | Representation |
---|---|
bin | 10011101010100000… |
… | …000001111001010101 |
3 | 2000111110222010220201 |
4 | 103222200001321111 |
5 | 321220204242401 |
6 | 13411045100501 |
7 | 1345141115164 |
oct | 235240017125 |
9 | 60443863821 |
10 | 21114134101 |
11 | 8a55418505 |
12 | 41130b7731 |
13 | 1cb6466a98 |
14 | 10442633db |
15 | 838994b01 |
hex | 4ea801e55 |
21114134101 has 8 divisors (see below), whose sum is σ = 21738878424. Its totient is φ = 20492236800.
The previous prime is 21114134089. The next prime is 21114134143. The reversal of 21114134101 is 10143141112.
It can be written as a sum of positive squares in 4 ways, for example, as 19775671876 + 1338462225 = 140626^2 + 36585^2 .
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 21114134101 - 27 = 21114133973 is a prime.
It is a super-2 number, since 2×211141341012 (a number of 21 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 (21114134191) 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, 696700 + ... + 726373.
It is an arithmetic number, because the mean of its divisors is an integer number (2717359803).
Almost surely, 221114134101 is an apocalyptic number.
It is an amenable number.
21114134101 is a deficient number, since it is larger than the sum of its proper divisors (624744323).
21114134101 is a wasteful number, since it uses less digits than its factorization.
21114134101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1423511.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 21114134101 its reverse (10143141112), we get a palindrome (31257275213).
The spelling of 21114134101 in words is "twenty-one billion, one hundred fourteen million, one hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •