Base | Representation |
---|---|
bin | 110000111010111110… |
… | …1101100011110110110 |
3 | 101001011200202202001020 |
4 | 1201311331230132312 |
5 | 3210124412303413 |
6 | 120132500242010 |
7 | 10406305002003 |
oct | 1416575543666 |
9 | 331150682036 |
10 | 105058322358 |
11 | 40611758600 |
12 | 1843b9a0306 |
13 | 9ba377b7b2 |
14 | 5128b848aa |
15 | 2aed361c23 |
hex | 1875f6c7b6 |
105058322358 has 96 divisors (see below), whose sum is σ = 242349408000. Its totient is φ = 30280704960.
The previous prime is 105058322323. The next prime is 105058322377. The reversal of 105058322358 is 853223850501.
It is a happy number.
It is a super-2 number, since 2×1050583223582 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2971368 + ... + 3006516.
It is an arithmetic number, because the mean of its divisors is an integer number (2524473000).
Almost surely, 2105058322358 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105058322358, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121174704000).
105058322358 is an abundant number, since it is smaller than the sum of its proper divisors (137291085642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105058322358 is a wasteful number, since it uses less digits than its factorization.
105058322358 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35378 (or 35367 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 42.
The spelling of 105058322358 in words is "one hundred five billion, fifty-eight million, three hundred twenty-two thousand, three hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •