Base | Representation |
---|---|
bin | 110001001000001111… |
… | …0001010011011011001 |
3 | 101002022200120210122222 |
4 | 1202100132022123121 |
5 | 3212032234304431 |
6 | 120244544153425 |
7 | 10423315024343 |
oct | 1422036123331 |
9 | 332280523588 |
10 | 105503041241 |
11 | 4081a797474 |
12 | 18544908875 |
13 | 9c44949770 |
14 | 516bc6a293 |
15 | 2b2740a57b |
hex | 189078a6d9 |
105503041241 has 32 divisors (see below), whose sum is σ = 118003200000. Its totient is φ = 93669488640.
The previous prime is 105503041229. The next prime is 105503041249. The reversal of 105503041241 is 142140305501.
It is not a de Polignac number, because 105503041241 - 210 = 105503040217 is a prime.
It is a super-2 number, since 2×1055030412412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105503041241.
It is not an unprimeable number, because it can be changed into a prime (105503041249) 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 31 ways as a sum of consecutive naturals, for example, 84469385 + ... + 84470633.
It is an arithmetic number, because the mean of its divisors is an integer number (3687600000).
Almost surely, 2105503041241 is an apocalyptic number.
It is an amenable number.
105503041241 is a deficient number, since it is larger than the sum of its proper divisors (12500158759).
105503041241 is a wasteful number, since it uses less digits than its factorization.
105503041241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2409.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 105503041241 its reverse (142140305501), we get a palindrome (247643346742).
The spelling of 105503041241 in words is "one hundred five billion, five hundred three million, forty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •