Base | Representation |
---|---|
bin | 10011100101001000… |
… | …100101111011000011 |
3 | 2000021012120011000101 |
4 | 103211020211323003 |
5 | 321024132313011 |
6 | 13354111303231 |
7 | 1342665636142 |
oct | 234510457303 |
9 | 60235504011 |
10 | 21024104131 |
11 | 8a09616678 |
12 | 40a8b1ab17 |
13 | 1ca0904304 |
14 | 1036309759 |
15 | 830b0e2c1 |
hex | 4e5225ec3 |
21024104131 has 8 divisors (see below), whose sum is σ = 21109933728. Its totient is φ = 20938392000.
The previous prime is 21024104099. The next prime is 21024104137. The reversal of 21024104131 is 13140142012.
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 21024104131 - 25 = 21024104099 is a prime.
It is a super-2 number, since 2×210241041312 (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 = 21024104099 and 21024104108.
It is not an unprimeable number, because it can be changed into a prime (21024104137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 338671 + ... + 395911.
It is an arithmetic number, because the mean of its divisors is an integer number (2638741716).
Almost surely, 221024104131 is an apocalyptic number.
21024104131 is a deficient number, since it is larger than the sum of its proper divisors (85829597).
21024104131 is a wasteful number, since it uses less digits than its factorization.
21024104131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58733.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 21024104131 its reverse (13140142012), we get a palindrome (34164246143).
The spelling of 21024104131 in words is "twenty-one billion, twenty-four million, one hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •