Base | Representation |
---|---|
bin | 110001001111011010… |
… | …0111011111001011000 |
3 | 101002221110210021212112 |
4 | 1202132310323321120 |
5 | 3213030414021211 |
6 | 120324510331452 |
7 | 10432301152325 |
oct | 1423664737130 |
9 | 332843707775 |
10 | 105743892056 |
11 | 40933741230 |
12 | 185b14b9b88 |
13 | 9c8280793a |
14 | 5191c43b4c |
15 | 2b3d63388b |
hex | 189ed3be58 |
105743892056 has 16 divisors (see below), whose sum is σ = 216294324840. Its totient is φ = 48065405440.
The previous prime is 105743892013. The next prime is 105743892061. The reversal of 105743892056 is 650298347501.
It is a happy number.
It is a super-2 number, since 2×1057438920562 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105743891995 and 105743892013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 600817481 + ... + 600817656.
It is a 1-persistent number, because it is pandigital, but 2⋅105743892056 = 211487784112 is not.
Almost surely, 2105743892056 is an apocalyptic number.
It is an amenable number.
105743892056 is an abundant number, since it is smaller than the sum of its proper divisors (110550432784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105743892056 is a wasteful number, since it uses less digits than its factorization.
105743892056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201635154 (or 1201635150 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 50.
Subtracting 105743892056 from its reverse (650298347501), we obtain a palindrome (544554455445).
It can be divided in two parts, 105743 and 892056, that added together give a palindrome (997799).
The spelling of 105743892056 in words is "one hundred five billion, seven hundred forty-three million, eight hundred ninety-two thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •