Base | Representation |
---|---|
bin | 100010011001101101001… |
… | …011111010101010011101 |
3 | 22101000001200012211001101 |
4 | 202121231023322222131 |
5 | 302213100321300323 |
6 | 5010011432513101 |
7 | 332540464124566 |
oct | 42315513725235 |
9 | 8330050184041 |
10 | 2364063853213 |
11 | 831659461217 |
12 | 32220824b791 |
13 | 141c12a3a61a |
14 | 825c809b16d |
15 | 41764a78dad |
hex | 2266d2faa9d |
2364063853213 has 6 divisors (see below), whose sum is σ = 2495036920254. Its totient is φ = 2239639439544.
The previous prime is 2364063853199. The next prime is 2364063853247. The reversal of 2364063853213 is 3123583604632.
It can be written as a sum of positive squares in only one way, i.e., 2249466031684 + 114597821529 = 1499822^2 + 338523^2 .
It is not a de Polignac number, because 2364063853213 - 229 = 2363526982301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2364063853513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3274326306 + ... + 3274327027.
It is an arithmetic number, because the mean of its divisors is an integer number (415839486709).
Almost surely, 22364063853213 is an apocalyptic number.
It is an amenable number.
2364063853213 is a deficient number, since it is larger than the sum of its proper divisors (130973067041).
2364063853213 is an equidigital number, since it uses as much as digits as its factorization.
2364063853213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6548653371 (or 6548653352 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 46.
The spelling of 2364063853213 in words is "two trillion, three hundred sixty-four billion, sixty-three million, eight hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •