Base | Representation |
---|---|
bin | 111100001100100010011… |
… | …001101011111101100111 |
3 | 112122110100220101122001111 |
4 | 330030202121223331213 |
5 | 1020233304422240223 |
6 | 12444201503205451 |
7 | 604601364333361 |
oct | 74144231537547 |
9 | 15573326348044 |
10 | 4136630665063 |
11 | 1355376194586 |
12 | 5698592a6887 |
13 | 24010c610500 |
14 | 1042dd2a3d31 |
15 | 7290aed030d |
hex | 3c32266bf67 |
4136630665063 has 48 divisors (see below), whose sum is σ = 4734369868800. Its totient is φ = 3608953639200.
The previous prime is 4136630665019. The next prime is 4136630665099. The reversal of 4136630665063 is 3605660366314.
It is a de Polignac number, because none of the positive numbers 2k-4136630665063 is a prime.
It is a super-2 number, since 2×41366306650632 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4136630664998 and 4136630665016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4136630665763) 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, 416532208 + ... + 416542138.
It is an arithmetic number, because the mean of its divisors is an integer number (98632705600).
Almost surely, 24136630665063 is an apocalyptic number.
4136630665063 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
4136630665063 is a deficient number, since it is larger than the sum of its proper divisors (597739203737).
4136630665063 is an frugal number, since it uses more digits than its factorization.
4136630665063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10117 (or 10018 counting only the distinct ones).
The product of its (nonzero) digits is 4199040, while the sum is 49.
The spelling of 4136630665063 in words is "four trillion, one hundred thirty-six billion, six hundred thirty million, six hundred sixty-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •