Base | Representation |
---|---|
bin | 1100011010010001111… |
… | …1000011100111100101 |
3 | 202101100011212202001202 |
4 | 3012210133003213211 |
5 | 11443130012032323 |
6 | 241540530332245 |
7 | 21255421421231 |
oct | 3064437034745 |
9 | 671304782052 |
10 | 213213002213 |
11 | 824721aa342 |
12 | 353a472a085 |
13 | 1714b87b393 |
14 | a468c555c1 |
15 | 582d44cd28 |
hex | 31a47c39e5 |
213213002213 has 4 divisors (see below), whose sum is σ = 222483132768. Its totient is φ = 203942871660.
The previous prime is 213213002159. The next prime is 213213002227. The reversal of 213213002213 is 312200312312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 213213002213 - 28 = 213213001957 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 (213213002243) 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, 4635065243 + ... + 4635065288.
It is an arithmetic number, because the mean of its divisors is an integer number (55620783192).
Almost surely, 2213213002213 is an apocalyptic number.
213213002213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
213213002213 is a deficient number, since it is larger than the sum of its proper divisors (9270130555).
213213002213 is an equidigital number, since it uses as much as digits as its factorization.
213213002213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9270130554.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 213213002213 its reverse (312200312312), we get a palindrome (525413314525).
The spelling of 213213002213 in words is "two hundred thirteen billion, two hundred thirteen million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •