Base | Representation |
---|---|
bin | 11111011111011011110… |
… | …011101101100111111101 |
3 | 21122212210210202020000020 |
4 | 133133123303231213331 |
5 | 240423441404111123 |
6 | 4334053113122353 |
7 | 312230222120445 |
oct | 37373363554775 |
9 | 7585723666006 |
10 | 2164056316413 |
11 | 764853412562 |
12 | 2ab4aa0b93b9 |
13 | 1290b9cacb04 |
14 | 76a52db7125 |
15 | 3b45ab167e3 |
hex | 1f7dbced9fd |
2164056316413 has 4 divisors (see below), whose sum is σ = 2885408421888. Its totient is φ = 1442704210940.
The previous prime is 2164056316381. The next prime is 2164056316417. The reversal of 2164056316413 is 3146136504612.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2164056316413 - 25 = 2164056316381 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2164056316417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 360676052733 + ... + 360676052738.
It is an arithmetic number, because the mean of its divisors is an integer number (721352105472).
Almost surely, 22164056316413 is an apocalyptic number.
It is an amenable number.
2164056316413 is a deficient number, since it is larger than the sum of its proper divisors (721352105475).
2164056316413 is an equidigital number, since it uses as much as digits as its factorization.
2164056316413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 721352105474.
The product of its (nonzero) digits is 311040, while the sum is 42.
The spelling of 2164056316413 in words is "two trillion, one hundred sixty-four billion, fifty-six million, three hundred sixteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •