Base | Representation |
---|---|
bin | 1011011111101011100101… |
… | …0011010101100010101101 |
3 | 1122202021012212002222011110 |
4 | 2313322321103111202231 |
5 | 3124033433033420030 |
6 | 42514122014542233 |
7 | 2443062534565314 |
oct | 267727123254255 |
9 | 48667185088143 |
10 | 12638902638765 |
11 | 4033146053727 |
12 | 1501606b07979 |
13 | 708ac6c63a70 |
14 | 319a247bb27b |
15 | 16db782611b0 |
hex | b7eb94d58ad |
12638902638765 has 128 divisors (see below), whose sum is σ = 22034073600000. Its totient is φ = 6149461893120.
The previous prime is 12638902638757. The next prime is 12638902638773. The reversal of 12638902638765 is 56783620983621.
It is an interprime number because it is at equal distance from previous prime (12638902638757) and next prime (12638902638773).
It is not a de Polignac number, because 12638902638765 - 23 = 12638902638757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12638902638696 and 12638902638705.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10119216861 + ... + 10119218109.
It is an arithmetic number, because the mean of its divisors is an integer number (172141200000).
Almost surely, 212638902638765 is an apocalyptic number.
12638902638765 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12638902638765 is a deficient number, since it is larger than the sum of its proper divisors (9395170961235).
12638902638765 is a wasteful number, since it uses less digits than its factorization.
12638902638765 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2707.
The product of its (nonzero) digits is 156764160, while the sum is 66.
The spelling of 12638902638765 in words is "twelve trillion, six hundred thirty-eight billion, nine hundred two million, six hundred thirty-eight thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •