Base | Representation |
---|---|
bin | 11101011111110110010… |
… | …00001100011000010101 |
3 | 10120220002200112020222212 |
4 | 32233323020030120111 |
5 | 113101202304344022 |
6 | 2053335353003205 |
7 | 133140142322063 |
oct | 16577310143025 |
9 | 3526080466885 |
10 | 1013530543637 |
11 | 360921629667 |
12 | 1445193b3505 |
13 | 74763557b91 |
14 | 370ab439033 |
15 | 1b56e5663e2 |
hex | ebfb20c615 |
1013530543637 has 16 divisors (see below), whose sum is σ = 1094053773120. Its totient is φ = 935822160000.
The previous prime is 1013530543621. The next prime is 1013530543651. The reversal of 1013530543637 is 7363450353101.
It is a cyclic number.
It is not a de Polignac number, because 1013530543637 - 24 = 1013530543621 is a prime.
It is a super-2 number, since 2×10135305436372 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013530543594 and 1013530543603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013530543237) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 968864 + ... + 1722137.
It is an arithmetic number, because the mean of its divisors is an integer number (68378360820).
Almost surely, 21013530543637 is an apocalyptic number.
It is an amenable number.
1013530543637 is a deficient number, since it is larger than the sum of its proper divisors (80523229483).
1013530543637 is a wasteful number, since it uses less digits than its factorization.
1013530543637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2691524.
The product of its (nonzero) digits is 340200, while the sum is 41.
Adding to 1013530543637 its reverse (7363450353101), we get a palindrome (8376980896738).
The spelling of 1013530543637 in words is "one trillion, thirteen billion, five hundred thirty million, five hundred forty-three thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •