Base | Representation |
---|---|
bin | 100001100000000101110… |
… | …101111110001101110001 |
3 | 22011002101022102010100211 |
4 | 201200011311332031301 |
5 | 300204401312131301 |
6 | 4521341042344121 |
7 | 325220450262442 |
oct | 41400565761561 |
9 | 8132338363324 |
10 | 2302200505201 |
11 | 8083a3192223 |
12 | 31222235b041 |
13 | 13913424055c |
14 | 7d5d9d612c9 |
15 | 3ed43958051 |
hex | 21805d7e371 |
2302200505201 has 4 divisors (see below), whose sum is σ = 2302205760000. Its totient is φ = 2302195250404.
The previous prime is 2302200505181. The next prime is 2302200505307. The reversal of 2302200505201 is 1025050022032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2302200505201 - 233 = 2293610570609 is a prime.
It is a super-2 number, since 2×23022005052012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2302200515201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1903801 + ... + 2868598.
It is an arithmetic number, because the mean of its divisors is an integer number (575551440000).
Almost surely, 22302200505201 is an apocalyptic number.
It is an amenable number.
2302200505201 is a deficient number, since it is larger than the sum of its proper divisors (5254799).
2302200505201 is an equidigital number, since it uses as much as digits as its factorization.
2302200505201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5254798.
The product of its (nonzero) digits is 1200, while the sum is 22.
Adding to 2302200505201 its reverse (1025050022032), we get a palindrome (3327250527233).
The spelling of 2302200505201 in words is "two trillion, three hundred two billion, two hundred million, five hundred five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •