Base | Representation |
---|---|
bin | 1100011001111010010… |
… | …1100010111110010101 |
3 | 202101002021122221201111 |
4 | 3012132211202332111 |
5 | 11442424143241323 |
6 | 241523033255021 |
7 | 21253110311254 |
oct | 3063645427625 |
9 | 671067587644 |
10 | 213114040213 |
11 | 82421357768 |
12 | 35377564471 |
13 | 1713420c199 |
14 | a459a5479b |
15 | 5824900c0d |
hex | 319e962f95 |
213114040213 has 4 divisors (see below), whose sum is σ = 213115069548. Its totient is φ = 213113010880.
The previous prime is 213114040193. The next prime is 213114040219. The reversal of 213114040213 is 312040411312.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 200039718564 + 13074321649 = 447258^2 + 114343^2 .
It is a cyclic number.
It is not a de Polignac number, because 213114040213 - 237 = 75675086741 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 (213114040219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83956 + ... + 658237.
It is an arithmetic number, because the mean of its divisors is an integer number (53278767387).
Almost surely, 2213114040213 is an apocalyptic number.
It is an amenable number.
213114040213 is a deficient number, since it is larger than the sum of its proper divisors (1029335).
213114040213 is an equidigital number, since it uses as much as digits as its factorization.
213114040213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1029334.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 213114040213 its reverse (312040411312), we get a palindrome (525154451525).
The spelling of 213114040213 in words is "two hundred thirteen billion, one hundred fourteen million, forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •