Base | Representation |
---|---|
bin | 110000000001100110110110… |
… | …1001111110100001001010001 |
3 | 2001101201020021212121100200121 |
4 | 1200003031231033310021101 |
5 | 420332121440330312434 |
6 | 4054235110425150241 |
7 | 154656541666262125 |
oct | 14003155517641121 |
9 | 2041636255540617 |
10 | 422433341260369 |
11 | 112666a7936624a |
12 | 3b4664b332b381 |
13 | 151933a70969ca |
14 | 7645c505dd585 |
15 | 33c86d99b77b4 |
hex | 180336d3f4251 |
422433341260369 has 2 divisors, whose sum is σ = 422433341260370. Its totient is φ = 422433341260368.
The previous prime is 422433341260321. The next prime is 422433341260423. The reversal of 422433341260369 is 963062143334224.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 211423581129744 + 211009760130625 = 14540412^2 + 14526175^2 .
It is a cyclic number.
It is not a de Polignac number, because 422433341260369 - 211 = 422433341258321 is a prime.
It is a super-2 number, since 2×4224333412603692 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (422433341260969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 211216670630184 + 211216670630185.
It is an arithmetic number, because the mean of its divisors is an integer number (211216670630185).
Almost surely, 2422433341260369 is an apocalyptic number.
It is an amenable number.
422433341260369 is a deficient number, since it is larger than the sum of its proper divisors (1).
422433341260369 is an equidigital number, since it uses as much as digits as its factorization.
422433341260369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13436928, while the sum is 52.
The spelling of 422433341260369 in words is "four hundred twenty-two trillion, four hundred thirty-three billion, three hundred forty-one million, two hundred sixty thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •