Base | Representation |
---|---|
bin | 110001001001101110… |
… | …1100101110111110001 |
3 | 101002110012000022022022 |
4 | 1202103131211313301 |
5 | 3212133111120103 |
6 | 120253535521225 |
7 | 10424464410320 |
oct | 1422335456761 |
9 | 332405008268 |
10 | 105553223153 |
11 | 40846051924 |
12 | 18559689215 |
13 | 9c521698c1 |
14 | 51747b00b7 |
15 | 2b2ba1e138 |
hex | 1893765df1 |
105553223153 has 4 divisors (see below), whose sum is σ = 120632255040. Its totient is φ = 90474191268.
The previous prime is 105553223141. The next prime is 105553223201. The reversal of 105553223153 is 351322355501.
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 105553223153 - 218 = 105552961009 is a prime.
It is a super-2 number, since 2×1055532231532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105553223353) 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, 7539515933 + ... + 7539515946.
It is an arithmetic number, because the mean of its divisors is an integer number (30158063760).
Almost surely, 2105553223153 is an apocalyptic number.
It is an amenable number.
105553223153 is a deficient number, since it is larger than the sum of its proper divisors (15079031887).
105553223153 is an equidigital number, since it uses as much as digits as its factorization.
105553223153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15079031886.
The product of its (nonzero) digits is 67500, while the sum is 35.
Adding to 105553223153 its reverse (351322355501), we get a palindrome (456875578654).
The spelling of 105553223153 in words is "one hundred five billion, five hundred fifty-three million, two hundred twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •