Base | Representation |
---|---|
bin | 110000100101001010011011… |
… | …110010001000000110000101 |
3 | 1001000111200221201021220100002 |
4 | 300211022123302020012011 |
5 | 211001101244004400103 |
6 | 2034230024112131045 |
7 | 63001300245516542 |
oct | 6045123362100605 |
9 | 1030450851256302 |
10 | 213660056715653 |
11 | 620957a2a00a39 |
12 | 1bb68900836a85 |
13 | 922b097ccba22 |
14 | 3aa92b8107bc9 |
15 | 19a7bc5c9b488 |
hex | c2529bc88185 |
213660056715653 has 8 divisors (see below), whose sum is σ = 221262978322848. Its totient is φ = 206176866157584.
The previous prime is 213660056715607. The next prime is 213660056715659. The reversal of 213660056715653 is 356517650066312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213660056715653 - 224 = 213660039938437 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 (213660056715659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29932758650 + ... + 29932765787.
It is an arithmetic number, because the mean of its divisors is an integer number (27657872290356).
Almost surely, 2213660056715653 is an apocalyptic number.
It is an amenable number.
213660056715653 is a deficient number, since it is larger than the sum of its proper divisors (7602921607195).
213660056715653 is an equidigital number, since it uses as much as digits as its factorization.
213660056715653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59865524563.
The product of its (nonzero) digits is 20412000, while the sum is 56.
The spelling of 213660056715653 in words is "two hundred thirteen trillion, six hundred sixty billion, fifty-six million, seven hundred fifteen thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •