Base | Representation |
---|---|
bin | 110001010100000101… |
… | …0011111010001111110 |
3 | 101010100101112200021120 |
4 | 1202220022133101332 |
5 | 3213341014140313 |
6 | 120352224011410 |
7 | 10436212466106 |
oct | 1425012372176 |
9 | 333311480246 |
10 | 105900536958 |
11 | 40a04101927 |
12 | 18635a60b66 |
13 | 9ca90c2228 |
14 | 51a897c206 |
15 | 2b4c276d23 |
hex | 18a829f47e |
105900536958 has 32 divisors (see below), whose sum is σ = 216365700096. Its totient is φ = 34539812448.
The previous prime is 105900536957. The next prime is 105900536969. The reversal of 105900536958 is 859635009501.
It is a super-3 number, since 3×1059005369583 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 105900536958.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105900536957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1040760 + ... + 1137972.
It is an arithmetic number, because the mean of its divisors is an integer number (6761428128).
Almost surely, 2105900536958 is an apocalyptic number.
105900536958 is an abundant number, since it is smaller than the sum of its proper divisors (110465163138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105900536958 is a wasteful number, since it uses less digits than its factorization.
105900536958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101128.
The product of its (nonzero) digits is 1458000, while the sum is 51.
The spelling of 105900536958 in words is "one hundred five billion, nine hundred million, five hundred thirty-six thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •