Base | Representation |
---|---|
bin | 101110100111111011000011… |
… | …001011100001100111001101 |
3 | 222220000221012011200002201200 |
4 | 232213323003023201213031 |
5 | 203334044234411132023 |
6 | 2004040154101100113 |
7 | 61122430305052665 |
oct | 5647730313414715 |
9 | 886027164602650 |
10 | 205053603224013 |
11 | 5a377821313445 |
12 | 1abb89189b7639 |
13 | 8a5561976157b |
14 | 388c90c4891a5 |
15 | 18a8dac652743 |
hex | ba7ec32e19cd |
205053603224013 has 48 divisors (see below), whose sum is σ = 317349242496000. Its totient is φ = 127197065103264.
The previous prime is 205053603224009. The next prime is 205053603224059. The reversal of 205053603224013 is 310422306350502.
205053603224013 is a `hidden beast` number, since 2 + 0 + 5 + 0 + 5 + 3 + 603 + 2 + 2 + 40 + 1 + 3 = 666.
It is not a de Polignac number, because 205053603224013 - 22 = 205053603224009 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205053603224003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1914898 + ... + 20341436.
It is an arithmetic number, because the mean of its divisors is an integer number (6611442552000).
Almost surely, 2205053603224013 is an apocalyptic number.
It is an amenable number.
205053603224013 is a deficient number, since it is larger than the sum of its proper divisors (112295639271987).
205053603224013 is a wasteful number, since it uses less digits than its factorization.
205053603224013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18427726 (or 18427723 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 36.
Adding to 205053603224013 its reverse (310422306350502), we get a palindrome (515475909574515).
The spelling of 205053603224013 in words is "two hundred five trillion, fifty-three billion, six hundred three million, two hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •