Base | Representation |
---|---|
bin | 101111110011000000001110… |
… | …000000000000111010110101 |
3 | 1000120022011210100212102000221 |
4 | 233303000032000000322311 |
5 | 210023112424220021323 |
6 | 2023030323235534341 |
7 | 62164252635653236 |
oct | 5763001600007265 |
9 | 1016264710772027 |
10 | 210213114220213 |
11 | 60a86976807295 |
12 | 1b6b086275a3b1 |
13 | 903b01c68a490 |
14 | 39ca52481308d |
15 | 19481d391b55d |
hex | bf300e000eb5 |
210213114220213 has 8 divisors (see below), whose sum is σ = 228111470981856. Its totient is φ = 192561631345200.
The previous prime is 210213114220201. The next prime is 210213114220237. The reversal of 210213114220213 is 312022411312012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-210213114220213 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 (210213114220273) 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, 61718469883 + ... + 61718473288.
It is an arithmetic number, because the mean of its divisors is an integer number (28513933872732).
Almost surely, 2210213114220213 is an apocalyptic number.
It is an amenable number.
210213114220213 is a deficient number, since it is larger than the sum of its proper divisors (17898356761643).
210213114220213 is a wasteful number, since it uses less digits than its factorization.
210213114220213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123436943315.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 210213114220213 its reverse (312022411312012), we get a palindrome (522235525532225).
The spelling of 210213114220213 in words is "two hundred ten trillion, two hundred thirteen billion, one hundred fourteen million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •