Base | Representation |
---|---|
bin | 110011010100100101… |
… | …0010011000000101101 |
3 | 101112110212202102212101 |
4 | 1212221022103000231 |
5 | 3301203312344323 |
6 | 122344130335101 |
7 | 10651106336230 |
oct | 1465112230055 |
9 | 345425672771 |
10 | 110212231213 |
11 | 42816a27607 |
12 | 19439a2a491 |
13 | a5154774c6 |
14 | 549746b417 |
15 | 2d00a6adad |
hex | 19a929302d |
110212231213 has 4 divisors (see below), whose sum is σ = 125956835680. Its totient is φ = 94467626748.
The previous prime is 110212231201. The next prime is 110212231223. The reversal of 110212231213 is 312132212011.
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, and also an emirpimes, since its reverse is a distinct semiprime: 312132212011 = 349 ⋅894361639.
It is a cyclic number.
It is not a de Polignac number, because 110212231213 - 29 = 110212230701 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 (110212231223) 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, 7872302223 + ... + 7872302236.
It is an arithmetic number, because the mean of its divisors is an integer number (31489208920).
Almost surely, 2110212231213 is an apocalyptic number.
It is an amenable number.
110212231213 is a deficient number, since it is larger than the sum of its proper divisors (15744604467).
110212231213 is an equidigital number, since it uses as much as digits as its factorization.
110212231213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15744604466.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 110212231213 its reverse (312132212011), we get a palindrome (422344443224).
The spelling of 110212231213 in words is "one hundred ten billion, two hundred twelve million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •