Base | Representation |
---|---|
bin | 111010100001111111010… |
… | …000001000001101001001 |
3 | 112020112001201200022021002 |
4 | 322201333100020031021 |
5 | 1011400003411322101 |
6 | 12315441230224345 |
7 | 563411316432644 |
oct | 72417720101511 |
9 | 15215051608232 |
10 | 4022224323401 |
11 | 13108a7853799 |
12 | 54b64a9550b5 |
13 | 2323a926cc5b |
14 | dc968bd4a5b |
15 | 6e962149d6b |
hex | 3a87f408349 |
4022224323401 has 2 divisors, whose sum is σ = 4022224323402. Its totient is φ = 4022224323400.
The previous prime is 4022224323391. The next prime is 4022224323431. The reversal of 4022224323401 is 1043234222204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3889174465801 + 133049857600 = 1972099^2 + 364760^2 .
It is a cyclic number.
It is not a de Polignac number, because 4022224323401 - 218 = 4022224061257 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (4022224323431) 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, 2011112161700 + 2011112161701.
It is an arithmetic number, because the mean of its divisors is an integer number (2011112161701).
Almost surely, 24022224323401 is an apocalyptic number.
It is an amenable number.
4022224323401 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022224323401 is an equidigital number, since it uses as much as digits as its factorization.
4022224323401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 29.
Adding to 4022224323401 its reverse (1043234222204), we get a palindrome (5065458545605).
The spelling of 4022224323401 in words is "four trillion, twenty-two billion, two hundred twenty-four million, three hundred twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •