Base | Representation |
---|---|
bin | 110001001001101101… |
… | …0000101010000101111 |
3 | 101002110010021120022011 |
4 | 1202103122011100233 |
5 | 3212132342200101 |
6 | 120253504102051 |
7 | 10424453526151 |
oct | 1422332052057 |
9 | 332403246264 |
10 | 105552303151 |
11 | 40845583699 |
12 | 18559304927 |
13 | 9c51c06c19 |
14 | 5174610ad1 |
15 | 2b2b8db751 |
hex | 189368542f |
105552303151 has 4 divisors (see below), whose sum is σ = 105593715000. Its totient is φ = 105510891304.
The previous prime is 105552303107. The next prime is 105552303169. The reversal of 105552303151 is 151303255501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105552303151 - 225 = 105518748719 is a prime.
It is a super-2 number, since 2×1055523031512 (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 (105552303551) 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, 20702101 + ... + 20707198.
It is an arithmetic number, because the mean of its divisors is an integer number (26398428750).
Almost surely, 2105552303151 is an apocalyptic number.
105552303151 is a deficient number, since it is larger than the sum of its proper divisors (41411849).
105552303151 is an equidigital number, since it uses as much as digits as its factorization.
105552303151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41411848.
The product of its (nonzero) digits is 11250, while the sum is 31.
Adding to 105552303151 its reverse (151303255501), we get a palindrome (256855558652).
The spelling of 105552303151 in words is "one hundred five billion, five hundred fifty-two million, three hundred three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •