Base | Representation |
---|---|
bin | 100100011111111000111011… |
… | …1100110011010101111000101 |
3 | 1120002201100002102222101222011 |
4 | 1020333301313212122233011 |
5 | 314034423432313013333 |
6 | 3054444432152534221 |
7 | 124423351354403065 |
oct | 11077616746325705 |
9 | 1502640072871864 |
10 | 321042222001093 |
11 | 9332627284782a |
12 | 300101726b1371 |
13 | 10a1a1c819c488 |
14 | 593c7528313a5 |
15 | 271b0a1a589cd |
hex | 123fc7799abc5 |
321042222001093 has 2 divisors, whose sum is σ = 321042222001094. Its totient is φ = 321042222001092.
The previous prime is 321042222001051. The next prime is 321042222001177. The reversal of 321042222001093 is 390100222240123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 242156952100449 + 78885269900644 = 15561393^2 + 8881738^2 .
It is a cyclic number.
It is not a de Polignac number, because 321042222001093 - 29 = 321042222000581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321042222001693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160521111000546 + 160521111000547.
It is an arithmetic number, because the mean of its divisors is an integer number (160521111000547).
Almost surely, 2321042222001093 is an apocalyptic number.
It is an amenable number.
321042222001093 is a deficient number, since it is larger than the sum of its proper divisors (1).
321042222001093 is an equidigital number, since it uses as much as digits as its factorization.
321042222001093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 321042222001093 in words is "three hundred twenty-one trillion, forty-two billion, two hundred twenty-two million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •