Base | Representation |
---|---|
bin | 111101011100000011000… |
… | …100010101011110000101 |
3 | 112221121201201222200000022 |
4 | 331130003010111132011 |
5 | 1023133131101221013 |
6 | 12551321221024525 |
7 | 614013126411005 |
oct | 75340304253605 |
9 | 15847651880008 |
10 | 4222004320133 |
11 | 13885a640a206 |
12 | 582304855145 |
13 | 248196b20082 |
14 | 1084bb9a8005 |
15 | 74c56113008 |
hex | 3d703115785 |
4222004320133 has 2 divisors, whose sum is σ = 4222004320134. Its totient is φ = 4222004320132.
The previous prime is 4222004320111. The next prime is 4222004320159. The reversal of 4222004320133 is 3310234002224.
It is an a-pointer prime, because the next prime (4222004320159) can be obtained adding 4222004320133 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3869313241249 + 352691078884 = 1967057^2 + 593878^2 .
It is a cyclic number.
It is not a de Polignac number, because 4222004320133 - 218 = 4222004057989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4222004020133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2111002160066 + 2111002160067.
It is an arithmetic number, because the mean of its divisors is an integer number (2111002160067).
Almost surely, 24222004320133 is an apocalyptic number.
It is an amenable number.
4222004320133 is a deficient number, since it is larger than the sum of its proper divisors (1).
4222004320133 is an equidigital number, since it uses as much as digits as its factorization.
4222004320133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 4222004320133 its reverse (3310234002224), we get a palindrome (7532238322357).
The spelling of 4222004320133 in words is "four trillion, two hundred twenty-two billion, four million, three hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •