Base | Representation |
---|---|
bin | 110001000110011010… |
… | …1011011011000010011 |
3 | 101002011102210011111222 |
4 | 1202030311123120103 |
5 | 3211421124443443 |
6 | 120234524355255 |
7 | 10421644322312 |
oct | 1421465333023 |
9 | 332142704458 |
10 | 105442031123 |
11 | 40799306690 |
12 | 185283a5b2b |
13 | 9c35107ac0 |
14 | 5163b08279 |
15 | 2b21da8468 |
hex | 188cd5b613 |
105442031123 has 32 divisors (see below), whose sum is σ = 131233556160. Its totient is φ = 83233013760.
The previous prime is 105442031117. The next prime is 105442031141. The reversal of 105442031123 is 321130244501.
It is a happy number.
It is not a de Polignac number, because 105442031123 - 28 = 105442030867 is a prime.
It is a super-2 number, since 2×1054420311232 (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 = 105442031092 and 105442031101.
It is not an unprimeable number, because it can be changed into a prime (105442031173) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4921811 + ... + 4943187.
It is an arithmetic number, because the mean of its divisors is an integer number (4101048630).
Almost surely, 2105442031123 is an apocalyptic number.
105442031123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
105442031123 is a deficient number, since it is larger than the sum of its proper divisors (25791525037).
105442031123 is a wasteful number, since it uses less digits than its factorization.
105442031123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23447.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 105442031123 its reverse (321130244501), we get a palindrome (426572275624).
The spelling of 105442031123 in words is "one hundred five billion, four hundred forty-two million, thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •