Base | Representation |
---|---|
bin | 1100011011010110010… |
… | …1111100001110110011 |
3 | 202102002011221201221122 |
4 | 3012311211330032303 |
5 | 11444222001112020 |
6 | 242025222212455 |
7 | 21265505136560 |
oct | 3066545741663 |
9 | 672064851848 |
10 | 213500019635 |
11 | 825aa216821 |
12 | 3546488412b |
13 | 17196181b86 |
14 | a495009867 |
15 | 5848745125 |
hex | 31b597c3b3 |
213500019635 has 8 divisors (see below), whose sum is σ = 292800026976. Its totient is φ = 146400013440.
The previous prime is 213500019631. The next prime is 213500019683. The reversal of 213500019635 is 536910005312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213500019635 - 22 = 213500019631 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 6100000561 = 213500019635 / (2 + 1 + 3 + 5 + 0 + 0 + 0 + 1 + 9 + 6 + 3 + 5).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213500019595 and 213500019604.
It is not an unprimeable number, because it can be changed into a prime (213500019631) 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, 3050000246 + ... + 3050000315.
It is an arithmetic number, because the mean of its divisors is an integer number (36600003372).
Almost surely, 2213500019635 is an apocalyptic number.
213500019635 is a deficient number, since it is larger than the sum of its proper divisors (79300007341).
213500019635 is an equidigital number, since it uses as much as digits as its factorization.
213500019635 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6100000573.
The product of its (nonzero) digits is 24300, while the sum is 35.
The spelling of 213500019635 in words is "two hundred thirteen billion, five hundred million, nineteen thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •