Base | Representation |
---|---|
bin | 10010010010110000… |
… | …01001000111000011 |
3 | 221100102221111110121 |
4 | 21021120021013003 |
5 | 130103134001011 |
6 | 4302310041111 |
7 | 465242060305 |
oct | 111130110703 |
9 | 27312844417 |
10 | 9821000131 |
11 | 418a775838 |
12 | 1aa1049197 |
13 | c068a68a7 |
14 | 692489975 |
15 | 3c7300e71 |
hex | 2496091c3 |
9821000131 has 4 divisors (see below), whose sum is σ = 9821921200. Its totient is φ = 9820079064.
The previous prime is 9821000099. The next prime is 9821000153. The reversal of 9821000131 is 1310001289.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 9821000131 - 25 = 9821000099 is a prime.
It is a super-2 number, since 2×98210001312 (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 = 9821000096 and 9821000105.
It is not an unprimeable number, because it can be changed into a prime (9821004131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 444351 + ... + 465928.
It is an arithmetic number, because the mean of its divisors is an integer number (2455480300).
Almost surely, 29821000131 is an apocalyptic number.
9821000131 is a deficient number, since it is larger than the sum of its proper divisors (921069).
9821000131 is a wasteful number, since it uses less digits than its factorization.
9821000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 921068.
The product of its (nonzero) digits is 432, while the sum is 25.
The square root of 9821000131 is about 99100.9592839545. The cubic root of 9821000131 is about 2141.5024336695.
The spelling of 9821000131 in words is "nine billion, eight hundred twenty-one million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •