Base | Representation |
---|---|
bin | 101110101000111011000010… |
… | …011111011011010000111101 |
3 | 222220021111112112201220010010 |
4 | 232220323002133123100331 |
5 | 203341210443122443123 |
6 | 2004131515554133433 |
7 | 61130412042523032 |
oct | 5650730237332075 |
9 | 886244475656103 |
10 | 205122311140413 |
11 | 5a3a397a124a27 |
12 | 1b00a0b2b81279 |
13 | 8a5bc492b32c4 |
14 | 3891d89641389 |
15 | 18aaa7e5d8993 |
hex | ba8ec27db43d |
205122311140413 has 32 divisors (see below), whose sum is σ = 293816045343744. Its totient is φ = 126976903143552.
The previous prime is 205122311140391. The next prime is 205122311140463. The reversal of 205122311140413 is 314041113221502.
It is not a de Polignac number, because 205122311140413 - 26 = 205122311140349 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205122311140463) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 211585656 + ... + 212552897.
It is an arithmetic number, because the mean of its divisors is an integer number (9181751416992).
Almost surely, 2205122311140413 is an apocalyptic number.
205122311140413 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
205122311140413 is a deficient number, since it is larger than the sum of its proper divisors (88693734203331).
205122311140413 is a wasteful number, since it uses less digits than its factorization.
205122311140413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424138785.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 205122311140413 its reverse (314041113221502), we get a palindrome (519163424361915).
The spelling of 205122311140413 in words is "two hundred five trillion, one hundred twenty-two billion, three hundred eleven million, one hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •