Base | Representation |
---|---|
bin | 1001010101111101111… |
… | …11111100010101001011 |
3 | 1010200122021100222212102 |
4 | 10222332333330111023 |
5 | 20224433143410011 |
6 | 403251410104015 |
7 | 32123321042024 |
oct | 4527677742513 |
9 | 1120567328772 |
10 | 321032013131 |
11 | 114170225035 |
12 | 52274b7b00b |
13 | 24372271aab |
14 | 11776509c4b |
15 | 853dd3173b |
hex | 4abeffc54b |
321032013131 has 4 divisors (see below), whose sum is σ = 321355961664. Its totient is φ = 320708064600.
The previous prime is 321032013101. The next prime is 321032013163. The reversal of 321032013131 is 131310230123.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131310230123 = 151 ⋅869604173.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-321032013131 is a prime.
It is a super-2 number, since 2×3210320131312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321032013101) 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, 161972780 + ... + 161974761.
It is an arithmetic number, because the mean of its divisors is an integer number (80338990416).
Almost surely, 2321032013131 is an apocalyptic number.
321032013131 is a deficient number, since it is larger than the sum of its proper divisors (323948533).
321032013131 is an equidigital number, since it uses as much as digits as its factorization.
321032013131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323948532.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 321032013131 its reverse (131310230123), we get a palindrome (452342243254).
The spelling of 321032013131 in words is "three hundred twenty-one billion, thirty-two million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •