Base | Representation |
---|---|
bin | 100100011110011011000… |
… | …0100111100011010000111 |
3 | 122202020202221020112122011 |
4 | 1020330312010330122013 |
5 | 1124113344312200403 |
6 | 14355000233515051 |
7 | 1025121064525153 |
oct | 110746604743207 |
9 | 18666687215564 |
10 | 5013134100103 |
11 | 1663070564348 |
12 | 68b6b4572a87 |
13 | 2a4976188a2c |
14 | 1348cbc5c063 |
15 | 8a60a811a6d |
hex | 48f3613c687 |
5013134100103 has 16 divisors (see below), whose sum is σ = 5290045679520. Its totient is φ = 4743373025664.
The previous prime is 5013134100089. The next prime is 5013134100113. The reversal of 5013134100103 is 3010014313105.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5013134100103 is a prime.
It is a super-2 number, since 2×50131341001032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5013134100113) 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, 600801 + ... + 3222922.
It is an arithmetic number, because the mean of its divisors is an integer number (330627854970).
Almost surely, 25013134100103 is an apocalyptic number.
5013134100103 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
5013134100103 is a deficient number, since it is larger than the sum of its proper divisors (276911579417).
5013134100103 is a wasteful number, since it uses less digits than its factorization.
5013134100103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3824658.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 5013134100103 its reverse (3010014313105), we get a palindrome (8023148413208).
The spelling of 5013134100103 in words is "five trillion, thirteen billion, one hundred thirty-four million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •