Base | Representation |
---|---|
bin | 110000000001100110110110… |
… | …1001111010110110101001111 |
3 | 2001101201020021212101020222201 |
4 | 1200003031231033112311033 |
5 | 420332121440312442203 |
6 | 4054235110422422331 |
7 | 154656541665252103 |
oct | 14003155517266517 |
9 | 2041636255336881 |
10 | 422433341140303 |
11 | 112666a79294019 |
12 | 3b4664b32919a7 |
13 | 151933a705416c |
14 | 7645c505ab903 |
15 | 33c86d9991e1d |
hex | 180336d3d6d4f |
422433341140303 has 2 divisors, whose sum is σ = 422433341140304. Its totient is φ = 422433341140302.
The previous prime is 422433341140301. The next prime is 422433341140397. The reversal of 422433341140303 is 303041143334224.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 422433341140303 - 21 = 422433341140301 is a prime.
It is a super-2 number, since 2×4224333411403032 (a number of 30 digits) contains 22 as substring.
Together with 422433341140301, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (422433341140301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 211216670570151 + 211216670570152.
It is an arithmetic number, because the mean of its divisors is an integer number (211216670570152).
Almost surely, 2422433341140303 is an apocalyptic number.
422433341140303 is a deficient number, since it is larger than the sum of its proper divisors (1).
422433341140303 is an equidigital number, since it uses as much as digits as its factorization.
422433341140303 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 248832, while the sum is 37.
Adding to 422433341140303 its reverse (303041143334224), we get a palindrome (725474484474527).
The spelling of 422433341140303 in words is "four hundred twenty-two trillion, four hundred thirty-three billion, three hundred forty-one million, one hundred forty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •