Base | Representation |
---|---|
bin | 110001001001001000… |
… | …0111010101101110011 |
3 | 101002101210012010200121 |
4 | 1202102100322231303 |
5 | 3212112434422233 |
6 | 120251541031111 |
7 | 10424131514506 |
oct | 1422220725563 |
9 | 332353163617 |
10 | 105533123443 |
11 | 408357736a0 |
12 | 185529b5497 |
13 | 9c4ac4cc97 |
14 | 5171c5b13d |
15 | 2b29d9d92d |
hex | 189243ab73 |
105533123443 has 8 divisors (see below), whose sum is σ = 115199974080. Its totient is φ = 95878427880.
The previous prime is 105533123401. The next prime is 105533123459. The reversal of 105533123443 is 344321335501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105533123443 - 233 = 96943188851 is a prime.
It is a super-2 number, since 2×1055331234432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105533123399 and 105533123408.
It is not an unprimeable number, because it can be changed into a prime (105533123483) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3020605 + ... + 3055342.
It is an arithmetic number, because the mean of its divisors is an integer number (14399996760).
Almost surely, 2105533123443 is an apocalyptic number.
105533123443 is a deficient number, since it is larger than the sum of its proper divisors (9666850637).
105533123443 is a wasteful number, since it uses less digits than its factorization.
105533123443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6077537.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 105533123443 its reverse (344321335501), we get a palindrome (449854458944).
The spelling of 105533123443 in words is "one hundred five billion, five hundred thirty-three million, one hundred twenty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •