Base | Representation |
---|---|
bin | 1100011001111010001… |
… | …0010110011000101111 |
3 | 202101002020002101012211 |
4 | 3012132202112120233 |
5 | 11442423434432343 |
6 | 241523003311251 |
7 | 21253100221165 |
oct | 3063642263057 |
9 | 671066071184 |
10 | 213113202223 |
11 | 82420935109 |
12 | 3537721b527 |
13 | 17133ca792c |
14 | a4598b7235 |
15 | 58247d779d |
hex | 319e89662f |
213113202223 has 8 divisors (see below), whose sum is σ = 235460111328. Its totient is φ = 191856386304.
The previous prime is 213113202199. The next prime is 213113202227. The reversal of 213113202223 is 322202311312.
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 213113202223 - 233 = 204523267631 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213113202194 and 213113202203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213113202227) 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, 272522886 + ... + 272523667.
It is an arithmetic number, because the mean of its divisors is an integer number (29432513916).
Almost surely, 2213113202223 is an apocalyptic number.
213113202223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
213113202223 is a deficient number, since it is larger than the sum of its proper divisors (22346909105).
213113202223 is a wasteful number, since it uses less digits than its factorization.
213113202223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545046593.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 213113202223 its reverse (322202311312), we get a palindrome (535315513535).
The spelling of 213113202223 in words is "two hundred thirteen billion, one hundred thirteen million, two hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •