Base | Representation |
---|---|
bin | 110001010000110011… |
… | …0110110101001001001 |
3 | 101010001201112212002010 |
4 | 1202201212312221021 |
5 | 3213124334012134 |
6 | 120333254130133 |
7 | 10433405454330 |
oct | 1424146665111 |
9 | 333051485063 |
10 | 105790532169 |
11 | 40957aa7683 |
12 | 18605050949 |
13 | 9c8c38793a |
14 | 5198104d17 |
15 | 2b42797ce9 |
hex | 18a19b6a49 |
105790532169 has 32 divisors (see below), whose sum is σ = 162733162240. Its totient is φ = 59878870272.
The previous prime is 105790532149. The next prime is 105790532173. The reversal of 105790532169 is 961235097501.
It is not a de Polignac number, because 105790532169 - 25 = 105790532137 is a prime.
It is a super-2 number, since 2×1057905321692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105790532149) 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 31 ways as a sum of consecutive naturals, for example, 11891487 + ... + 11900379.
It is an arithmetic number, because the mean of its divisors is an integer number (5085411320).
Almost surely, 2105790532169 is an apocalyptic number.
It is an amenable number.
105790532169 is a deficient number, since it is larger than the sum of its proper divisors (56942630071).
105790532169 is a wasteful number, since it uses less digits than its factorization.
105790532169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14209.
The product of its (nonzero) digits is 510300, while the sum is 48.
The spelling of 105790532169 in words is "one hundred five billion, seven hundred ninety million, five hundred thirty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •