Base | Representation |
---|---|
bin | 100100100001110000111110… |
… | …0011011010101100011100011 |
3 | 1120010121222110111200101002122 |
4 | 1021003201330123111203203 |
5 | 314103134400230121011 |
6 | 3055203103251534455 |
7 | 124451105356042460 |
oct | 11103417433254343 |
9 | 1503558414611078 |
10 | 321300001020131 |
11 | 93415624336131 |
12 | 300521142ba42b |
13 | 10a385c9a7c3c3 |
14 | 594b008426667 |
15 | 2722b3c76c3db |
hex | 124387c6d58e3 |
321300001020131 has 4 divisors (see below), whose sum is σ = 367200001165872. Its totient is φ = 275400000874392.
The previous prime is 321300001020107. The next prime is 321300001020149. The reversal of 321300001020131 is 131020100003123.
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 321300001020131 - 238 = 321025123113187 is a prime.
It is a super-2 number, since 2×3213000010201312 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (321300001020161) 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, 22950000072860 + ... + 22950000072873.
It is an arithmetic number, because the mean of its divisors is an integer number (91800000291468).
Almost surely, 2321300001020131 is an apocalyptic number.
321300001020131 is a deficient number, since it is larger than the sum of its proper divisors (45900000145741).
321300001020131 is an equidigital number, since it uses as much as digits as its factorization.
321300001020131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45900000145740.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 321300001020131 its reverse (131020100003123), we get a palindrome (452320101023254).
The spelling of 321300001020131 in words is "three hundred twenty-one trillion, three hundred billion, one million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •