Base | Representation |
---|---|
bin | 1100011001100100001… |
… | …1000101101011000111 |
3 | 202100211210211011211102 |
4 | 3012121003011223013 |
5 | 11442231401334343 |
6 | 241505513530315 |
7 | 21250601440361 |
oct | 3063103055307 |
9 | 670753734742 |
10 | 213021121223 |
11 | 82383962309 |
12 | 3535041399b |
13 | 1711aba7731 |
14 | a44b587d31 |
15 | 581b6993b8 |
hex | 31990c5ac7 |
213021121223 has 8 divisors (see below), whose sum is σ = 221206032096. Its totient is φ = 204978556800.
The previous prime is 213021121219. The next prime is 213021121249. The reversal of 213021121223 is 322121120312.
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 213021121223 - 22 = 213021121219 is a prime.
It is a super-2 number, since 2×2130211212232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213021121195 and 213021121204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213021120223) 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, 35583563 + ... + 35589548.
It is an arithmetic number, because the mean of its divisors is an integer number (27650754012).
Almost surely, 2213021121223 is an apocalyptic number.
213021121223 is a deficient number, since it is larger than the sum of its proper divisors (8184910873).
213021121223 is an equidigital number, since it uses as much as digits as its factorization.
213021121223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71173225.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 213021121223 its reverse (322121120312), we get a palindrome (535142241535).
The spelling of 213021121223 in words is "two hundred thirteen billion, twenty-one million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •