Base | Representation |
---|---|
bin | 110001001001101110… |
… | …1100111110101101101 |
3 | 101002110012000201100211 |
4 | 1202103131213311231 |
5 | 3212133111344323 |
6 | 120253540022421 |
7 | 10424464442653 |
oct | 1422335476555 |
9 | 332405021324 |
10 | 105553231213 |
11 | 40846057991 |
12 | 18559691a11 |
13 | 9c52170481 |
14 | 51747b2dd3 |
15 | 2b2ba2170d |
hex | 1893767d6d |
105553231213 has 4 divisors (see below), whose sum is σ = 105638978368. Its totient is φ = 105467484060.
The previous prime is 105553231169. The next prime is 105553231219. The reversal of 105553231213 is 312132355501.
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 105553231213 - 29 = 105553230701 is a prime.
It is a super-2 number, since 2×1055532312132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105553231219) 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, 42871731 + ... + 42874192.
It is an arithmetic number, because the mean of its divisors is an integer number (26409744592).
Almost surely, 2105553231213 is an apocalyptic number.
It is an amenable number.
105553231213 is a deficient number, since it is larger than the sum of its proper divisors (85747155).
105553231213 is an equidigital number, since it uses as much as digits as its factorization.
105553231213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85747154.
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 105553231213 its reverse (312132355501), we get a palindrome (417685586714).
The spelling of 105553231213 in words is "one hundred five billion, five hundred fifty-three million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •