Base | Representation |
---|---|
bin | 1100011010100111001… |
… | …0100100000101011101 |
3 | 202101120101100101211122 |
4 | 3012221302210011131 |
5 | 11443320303031023 |
6 | 241553430100325 |
7 | 21260552046662 |
oct | 3065162440535 |
9 | 671511311748 |
10 | 213302002013 |
11 | 825084681a1 |
12 | 3540a4aa6a5 |
13 | 1716413cc99 |
14 | a4769c1a69 |
15 | 583617d2c8 |
hex | 31a9ca415d |
213302002013 has 8 divisors (see below), whose sum is σ = 225871794432. Its totient is φ = 200734722496.
The previous prime is 213302001989. The next prime is 213302002031. The reversal of 213302002013 is 310200203312.
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 213302002013 - 218 = 213301739869 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 213302001982 and 213302002000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213302002073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 452045 + ... + 794322.
It is an arithmetic number, because the mean of its divisors is an integer number (28233974304).
Almost surely, 2213302002013 is an apocalyptic number.
It is an amenable number.
213302002013 is a deficient number, since it is larger than the sum of its proper divisors (12569792419).
213302002013 is a wasteful number, since it uses less digits than its factorization.
213302002013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1256451.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 213302002013 its reverse (310200203312), we get a palindrome (523502205325).
The spelling of 213302002013 in words is "two hundred thirteen billion, three hundred two million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •