Base | Representation |
---|---|
bin | 101110111001000000000… |
… | …100001110010011110101 |
3 | 102102001022122112122101211 |
4 | 232321000010032103311 |
5 | 410243232340233023 |
6 | 10504145422521421 |
7 | 451542414544204 |
oct | 56710004162365 |
9 | 12361278478354 |
10 | 3222300321013 |
11 | 103262a587144 |
12 | 440605a36271 |
13 | 1a4b27c81ca7 |
14 | b1d629b323b |
15 | 58c4586aa0d |
hex | 2ee4010e4f5 |
3222300321013 has 2 divisors, whose sum is σ = 3222300321014. Its totient is φ = 3222300321012.
The previous prime is 3222300320957. The next prime is 3222300321043. The reversal of 3222300321013 is 3101230032223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2868629852209 + 353670468804 = 1693703^2 + 594702^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3222300321013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3222300321043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611150160506 + 1611150160507.
It is an arithmetic number, because the mean of its divisors is an integer number (1611150160507).
Almost surely, 23222300321013 is an apocalyptic number.
It is an amenable number.
3222300321013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3222300321013 is an equidigital number, since it uses as much as digits as its factorization.
3222300321013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 3222300321013 its reverse (3101230032223), we get a palindrome (6323530353236).
The spelling of 3222300321013 in words is "three trillion, two hundred twenty-two billion, three hundred million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •