Base | Representation |
---|---|
bin | 110001000110100111… |
… | …1000101001011100001 |
3 | 101002011220102211020011 |
4 | 1202031033011023201 |
5 | 3211424340142222 |
6 | 120235324444521 |
7 | 10422055431220 |
oct | 1421517051341 |
9 | 332156384204 |
10 | 105448755937 |
11 | 407a208a088 |
12 | 1852a6a9741 |
13 | 9c36620995 |
14 | 5164978cb7 |
15 | 2b22785c77 |
hex | 188d3c52e1 |
105448755937 has 48 divisors (see below), whose sum is σ = 134324628480. Its totient is φ = 80914119264.
The previous prime is 105448755931. The next prime is 105448755953. The reversal of 105448755937 is 739557844501.
It is not a de Polignac number, because 105448755937 - 215 = 105448723169 is a prime.
It is a super-2 number, since 2×1054487559372 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (58) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (105448755931) 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 47 ways as a sum of consecutive naturals, for example, 4813114 + ... + 4834972.
It is an arithmetic number, because the mean of its divisors is an integer number (2798429760).
Almost surely, 2105448755937 is an apocalyptic number.
It is an amenable number.
105448755937 is a deficient number, since it is larger than the sum of its proper divisors (28875872543).
105448755937 is a wasteful number, since it uses less digits than its factorization.
105448755937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22010 (or 21991 counting only the distinct ones).
The product of its (nonzero) digits is 21168000, while the sum is 58.
The spelling of 105448755937 in words is "one hundred five billion, four hundred forty-eight million, seven hundred fifty-five thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •