Base | Representation |
---|---|
bin | 110000111100010011… |
… | …0010110101000110111 |
3 | 101001021202221222200202 |
4 | 1201320212112220313 |
5 | 3210222222111343 |
6 | 120141120031115 |
7 | 10410352544330 |
oct | 1417046265067 |
9 | 331252858622 |
10 | 105102535223 |
11 | 40634706364 |
12 | 1845276249b |
13 | 9bac98ba5a |
14 | 51309b3287 |
15 | 2b02196db8 |
hex | 1878996a37 |
105102535223 has 4 divisors (see below), whose sum is σ = 120117183120. Its totient is φ = 90087887328.
The previous prime is 105102535169. The next prime is 105102535247. The reversal of 105102535223 is 322535201501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105102535223 is a prime.
It is a super-2 number, since 2×1051025352232 (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 (105102535423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7507323938 + ... + 7507323951.
It is an arithmetic number, because the mean of its divisors is an integer number (30029295780).
Almost surely, 2105102535223 is an apocalyptic number.
105102535223 is a deficient number, since it is larger than the sum of its proper divisors (15014647897).
105102535223 is an equidigital number, since it uses as much as digits as its factorization.
105102535223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15014647896.
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 105102535223 its reverse (322535201501), we get a palindrome (427637736724).
The spelling of 105102535223 in words is "one hundred five billion, one hundred two million, five hundred thirty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •