Base | Representation |
---|---|
bin | 1100011010011001110… |
… | …0100100000100111001 |
3 | 202101102110210021200101 |
4 | 3012212130210010321 |
5 | 11443211422400121 |
6 | 241544103435401 |
7 | 21256301161324 |
oct | 3064634440471 |
9 | 671373707611 |
10 | 213245903161 |
11 | 82489831305 |
12 | 353b3755b61 |
13 | 1715562a8b5 |
14 | a46d37b7bb |
15 | 583129b491 |
hex | 31a6724139 |
213245903161 has 4 divisors (see below), whose sum is σ = 222517464192. Its totient is φ = 203974342132.
The previous prime is 213245903159. The next prime is 213245903173. The reversal of 213245903161 is 161309542312.
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 213245903161 - 21 = 213245903159 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 213245903161.
It is not an unprimeable number, because it can be changed into a prime (213245903111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4635780481 + ... + 4635780526.
It is an arithmetic number, because the mean of its divisors is an integer number (55629366048).
Almost surely, 2213245903161 is an apocalyptic number.
It is an amenable number.
213245903161 is a deficient number, since it is larger than the sum of its proper divisors (9271561031).
213245903161 is an equidigital number, since it uses as much as digits as its factorization.
213245903161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9271561030.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 213245903161 in words is "two hundred thirteen billion, two hundred forty-five million, nine hundred three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •