Base | Representation |
---|---|
bin | 11110110001001110001… |
… | …101010001111001001001 |
3 | 21111010201200101200001200 |
4 | 132301032031101321021 |
5 | 234120331104414031 |
6 | 4255205233534413 |
7 | 305522460366630 |
oct | 36611615217111 |
9 | 7433650350050 |
10 | 2114436013641 |
11 | 745800008676 |
12 | 2a1960414409 |
13 | 12450cac3503 |
14 | 744a6c84517 |
15 | 3a0047748e6 |
hex | 1ec4e351e49 |
2114436013641 has 24 divisors (see below), whose sum is σ = 3490640222784. Its totient is φ = 1208199762720.
The previous prime is 2114436013579. The next prime is 2114436013667. The reversal of 2114436013641 is 1463106344112.
2114436013641 is a `hidden beast` number, since 2 + 1 + 1 + 4 + 4 + 3 + 6 + 0 + 1 + 3 + 641 = 666.
It is not a de Polignac number, because 2114436013641 - 221 = 2114433916489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2114436013596 and 2114436013605.
It is not an unprimeable number, because it can be changed into a prime (2114436013681) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 896286 + ... + 2243256.
It is an arithmetic number, because the mean of its divisors is an integer number (145443342616).
Almost surely, 22114436013641 is an apocalyptic number.
2114436013641 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2114436013641 is a deficient number, since it is larger than the sum of its proper divisors (1376204209143).
2114436013641 is a wasteful number, since it uses less digits than its factorization.
2114436013641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1371901 (or 1371898 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
The spelling of 2114436013641 in words is "two trillion, one hundred fourteen billion, four hundred thirty-six million, thirteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •