Base | Representation |
---|---|
bin | 110001001001010101… |
… | …1010011101011011001 |
3 | 101002102021012121101110 |
4 | 1202102223103223121 |
5 | 3212121222311213 |
6 | 120252345210533 |
7 | 10424244356541 |
oct | 1422253235331 |
9 | 332367177343 |
10 | 105540041433 |
11 | 40839669242 |
12 | 18555190a49 |
13 | 9c4c502a78 |
14 | 5172b3c321 |
15 | 2b2a7b85c3 |
hex | 1892ad3ad9 |
105540041433 has 16 divisors (see below), whose sum is σ = 143538099200. Its totient is φ = 68961560976.
The previous prime is 105540041423. The next prime is 105540041483. The reversal of 105540041433 is 334140045501.
It is not a de Polignac number, because 105540041433 - 214 = 105540025049 is a prime.
It is a super-2 number, since 2×1055400414332 (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 105540041433.
It is not an unprimeable number, because it can be changed into a prime (105540041413) 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 15 ways as a sum of consecutive naturals, for example, 1279285 + ... + 1359282.
It is an arithmetic number, because the mean of its divisors is an integer number (8971131200).
Almost surely, 2105540041433 is an apocalyptic number.
It is an amenable number.
105540041433 is a deficient number, since it is larger than the sum of its proper divisors (37998057767).
105540041433 is a wasteful number, since it uses less digits than its factorization.
105540041433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2638836.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 105540041433 its reverse (334140045501), we get a palindrome (439680086934).
The spelling of 105540041433 in words is "one hundred five billion, five hundred forty million, forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •