Base | Representation |
---|---|
bin | 1001010110001001110… |
… | …01111110011001001101 |
3 | 1010200220011211201222101 |
4 | 10223010321332121031 |
5 | 20230134031041023 |
6 | 403305310115101 |
7 | 32125633262035 |
oct | 4530471763115 |
9 | 1120804751871 |
10 | 321131112013 |
11 | 114211160538 |
12 | 522a21aba91 |
13 | 2438995b39a |
14 | 117857448c5 |
15 | 85478a91ad |
hex | 4ac4e7e64d |
321131112013 has 4 divisors (see below), whose sum is σ = 321137190400. Its totient is φ = 321125033628.
The previous prime is 321131112007. The next prime is 321131112023. The reversal of 321131112013 is 310211131123.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 321131112013 - 25 = 321131111981 is a prime.
It is a super-2 number, since 2×3211311120132 (a number of 24 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 (321131112023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2959245 + ... + 3065842.
It is an arithmetic number, because the mean of its divisors is an integer number (80284297600).
Almost surely, 2321131112013 is an apocalyptic number.
It is an amenable number.
321131112013 is a deficient number, since it is larger than the sum of its proper divisors (6078387).
321131112013 is an equidigital number, since it uses as much as digits as its factorization.
321131112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6078386.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 321131112013 its reverse (310211131123), we get a palindrome (631342243136).
The spelling of 321131112013 in words is "three hundred twenty-one billion, one hundred thirty-one million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •