Base | Representation |
---|---|
bin | 100100100001001000100001… |
… | …0100001111011000111101101 |
3 | 1120010022200020100010200200211 |
4 | 1021002101002201323013231 |
5 | 314100223442330304123 |
6 | 3055055135215222421 |
7 | 124441611545225260 |
oct | 11102210241730755 |
9 | 1503280210120624 |
10 | 321213130322413 |
11 | 933917a607017a |
12 | 3003930b517a11 |
13 | 10a303643746a4 |
14 | 5946b26d8ccd7 |
15 | 2720755ec640d |
hex | 124244287b1ed |
321213130322413 has 8 divisors (see below), whose sum is σ = 367106896728000. Its totient is φ = 275320908006720.
The previous prime is 321213130322393. The next prime is 321213130322453. The reversal of 321213130322413 is 314223031312123.
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 321213130322413 - 241 = 319014107066861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321213130322453) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 385576663 + ... + 386408836.
It is an arithmetic number, because the mean of its divisors is an integer number (45888362091000).
Almost surely, 2321213130322413 is an apocalyptic number.
It is an amenable number.
321213130322413 is a deficient number, since it is larger than the sum of its proper divisors (45893766405587).
321213130322413 is an equidigital number, since it uses as much as digits as its factorization.
321213130322413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772044947.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 321213130322413 its reverse (314223031312123), we get a palindrome (635436161634536).
The spelling of 321213130322413 in words is "three hundred twenty-one trillion, two hundred thirteen billion, one hundred thirty million, three hundred twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •