Base | Representation |
---|---|
bin | 1001010010000000110001… |
… | …1110000100011110000001 |
3 | 1100010121000120210221210112 |
4 | 2110200030132010132001 |
5 | 2314144421141121023 |
6 | 33412045210241105 |
7 | 2102201455360565 |
oct | 224401436043601 |
9 | 40117016727715 |
10 | 10205051504513 |
11 | 3284a35590338 |
12 | 1189983126195 |
13 | 590441b9a408 |
14 | 273cda07b6a5 |
15 | 12a6cbae4478 |
hex | 9480c784781 |
10205051504513 has 8 divisors (see below), whose sum is σ = 10614660815616. Its totient is φ = 9800468074800.
The previous prime is 10205051504509. The next prime is 10205051504519. The reversal of 10205051504513 is 31540515050201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10205051504513 - 22 = 10205051504509 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10205051504513.
It is not an unprimeable number, because it can be changed into a prime (10205051504519) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1256466206 + ... + 1256474327.
It is an arithmetic number, because the mean of its divisors is an integer number (1326832601952).
Almost surely, 210205051504513 is an apocalyptic number.
It is an amenable number.
10205051504513 is a deficient number, since it is larger than the sum of its proper divisors (409609311103).
10205051504513 is a wasteful number, since it uses less digits than its factorization.
10205051504513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2512940695.
The product of its (nonzero) digits is 15000, while the sum is 32.
Adding to 10205051504513 its reverse (31540515050201), we get a palindrome (41745566554714).
The spelling of 10205051504513 in words is "ten trillion, two hundred five billion, fifty-one million, five hundred four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •