Base | Representation |
---|---|
bin | 100000000100111010110… |
… | …100110000111100011101 |
3 | 21210201200210222222011111 |
4 | 200010322310300330131 |
5 | 242103404103231331 |
6 | 4404351021022021 |
7 | 315153510325153 |
oct | 40047264607435 |
9 | 7721623888144 |
10 | 2204305133341 |
11 | 77a927866423 |
12 | 2b72613b4911 |
13 | 12cb3277c40c |
14 | 789906333d3 |
15 | 3c51439bdb1 |
hex | 2013ad30f1d |
2204305133341 has 2 divisors, whose sum is σ = 2204305133342. Its totient is φ = 2204305133340.
The previous prime is 2204305133279. The next prime is 2204305133351. The reversal of 2204305133341 is 1433315034022.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2203603678116 + 701455225 = 1484454^2 + 26485^2 .
It is a cyclic number.
It is not a de Polignac number, because 2204305133341 - 213 = 2204305125149 is a prime.
It is a super-2 number, since 2×22043051333412 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2204305133351) 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, 1102152566670 + 1102152566671.
It is an arithmetic number, because the mean of its divisors is an integer number (1102152566671).
Almost surely, 22204305133341 is an apocalyptic number.
It is an amenable number.
2204305133341 is a deficient number, since it is larger than the sum of its proper divisors (1).
2204305133341 is an equidigital number, since it uses as much as digits as its factorization.
2204305133341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 31.
The spelling of 2204305133341 in words is "two trillion, two hundred four billion, three hundred five million, one hundred thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •