Base | Representation |
---|---|
bin | 100100100001111010010101… |
… | …1001000101100000000011111 |
3 | 1120010200220101002001200102002 |
4 | 1021003310223020230000133 |
5 | 314104002042133411333 |
6 | 3055220231024152515 |
7 | 124452416626465652 |
oct | 11103645310540037 |
9 | 1503626332050362 |
10 | 321320112013343 |
11 | 93423104484a83 |
12 | 30055ba746873b |
13 | 10a3a4834494a1 |
14 | 594bd95361899 |
15 | 27234181100e8 |
hex | 1243d2b22c01f |
321320112013343 has 2 divisors, whose sum is σ = 321320112013344. Its totient is φ = 321320112013342.
The previous prime is 321320112013291. The next prime is 321320112013361. The reversal of 321320112013343 is 343310211023123.
It is a strong prime.
It is an emirp because it is prime and its reverse (343310211023123) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 321320112013343 - 220 = 321320110964767 is a prime.
It is a super-2 number, since 2×3213201120133432 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321320112010343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160660056006671 + 160660056006672.
It is an arithmetic number, because the mean of its divisors is an integer number (160660056006672).
Almost surely, 2321320112013343 is an apocalyptic number.
321320112013343 is a deficient number, since it is larger than the sum of its proper divisors (1).
321320112013343 is an equidigital number, since it uses as much as digits as its factorization.
321320112013343 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 321320112013343 its reverse (343310211023123), we get a palindrome (664630323036466).
The spelling of 321320112013343 in words is "three hundred twenty-one trillion, three hundred twenty billion, one hundred twelve million, thirteen thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •