Base | Representation |
---|---|
bin | 110001110011000101101… |
… | …010001010101111010001 |
3 | 110010011001201221210021012 |
4 | 301303011222022233101 |
5 | 422031440143230301 |
6 | 11140032400340305 |
7 | 502145036121614 |
oct | 61630552125721 |
9 | 13104051853235 |
10 | 3422110133201 |
11 | 10aa343a57431 |
12 | 473289914695 |
13 | 1ba91ba710a6 |
14 | bb8b970817b |
15 | 5e03c272ebb |
hex | 31cc5a8abd1 |
3422110133201 has 2 divisors, whose sum is σ = 3422110133202. Its totient is φ = 3422110133200.
The previous prime is 3422110133191. The next prime is 3422110133237. The reversal of 3422110133201 is 1023310112243.
3422110133201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2051056486801 + 1371053646400 = 1432151^2 + 1170920^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3422110133201 is a prime.
It is not a weakly prime, because it can be changed into another prime (3422110133401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1711055066600 + 1711055066601.
It is an arithmetic number, because the mean of its divisors is an integer number (1711055066601).
Almost surely, 23422110133201 is an apocalyptic number.
It is an amenable number.
3422110133201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3422110133201 is an equidigital number, since it uses as much as digits as its factorization.
3422110133201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 3422110133201 its reverse (1023310112243), we get a palindrome (4445420245444).
The spelling of 3422110133201 in words is "three trillion, four hundred twenty-two billion, one hundred ten million, one hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •