Base | Representation |
---|---|
bin | 10011100101101110… |
… | …100010011000111011 |
3 | 2000021220021111201210 |
4 | 103211232202120323 |
5 | 321034204114011 |
6 | 13355104414203 |
7 | 1343146325142 |
oct | 234556423073 |
9 | 60256244653 |
10 | 21034051131 |
11 | 8a1419aa35 |
12 | 40b0317363 |
13 | 1ca29a7a02 |
14 | 1037778759 |
15 | 8319266a6 |
hex | 4e5ba263b |
21034051131 has 4 divisors (see below), whose sum is σ = 28045401512. Its totient is φ = 14022700752.
The previous prime is 21034051109. The next prime is 21034051177. The reversal of 21034051131 is 13115043012.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 21034051131 - 26 = 21034051067 is a prime.
It is a super-2 number, since 2×210340511312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21034051098 and 21034051107.
It is not an unprimeable number, because it can be changed into a prime (21034052131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3505675186 + ... + 3505675191.
It is an arithmetic number, because the mean of its divisors is an integer number (7011350378).
Almost surely, 221034051131 is an apocalyptic number.
21034051131 is a deficient number, since it is larger than the sum of its proper divisors (7011350381).
21034051131 is an equidigital number, since it uses as much as digits as its factorization.
21034051131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7011350380.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 21034051131 its reverse (13115043012), we get a palindrome (34149094143).
The spelling of 21034051131 in words is "twenty-one billion, thirty-four million, fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •