Base | Representation |
---|---|
bin | 100100100010101000111101… |
… | …1011110101101111010010101 |
3 | 1120011001110211110110111001002 |
4 | 1021011101323132231322111 |
5 | 314112122130004312042 |
6 | 3055334231032513045 |
7 | 124462563200240240 |
oct | 11105217336557225 |
9 | 1504043743414032 |
10 | 321420244213397 |
11 | 934616184a4a1a |
12 | 3007149154b785 |
13 | 10a46a50464bc4 |
14 | 5952b73b96257 |
15 | 2725d28c60132 |
hex | 124547b7ade95 |
321420244213397 has 4 divisors (see below), whose sum is σ = 367337421958176. Its totient is φ = 275503066468620.
The previous prime is 321420244213363. The next prime is 321420244213399. The reversal of 321420244213397 is 793312442024123.
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 321420244213397 - 28 = 321420244213141 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 (321420244213399) 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, 22958588872379 + ... + 22958588872392.
It is an arithmetic number, because the mean of its divisors is an integer number (91834355489544).
Almost surely, 2321420244213397 is an apocalyptic number.
It is an amenable number.
321420244213397 is a deficient number, since it is larger than the sum of its proper divisors (45917177744779).
321420244213397 is an equidigital number, since it uses as much as digits as its factorization.
321420244213397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45917177744778.
The product of its (nonzero) digits is 1741824, while the sum is 47.
The spelling of 321420244213397 in words is "three hundred twenty-one trillion, four hundred twenty billion, two hundred forty-four million, two hundred thirteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •