Base | Representation |
---|---|
bin | 110001001000011011… |
… | …1000101110111000010 |
3 | 101002100010212210211220 |
4 | 1202100313011313002 |
5 | 3212040422414010 |
6 | 120245340215510 |
7 | 10423424412450 |
oct | 1422067056702 |
9 | 332303783756 |
10 | 105509576130 |
11 | 40823450202 |
12 | 18546b3a596 |
13 | 9c460c706a |
14 | 516ca8b9d0 |
15 | 2b27c9b970 |
hex | 1890dc5dc2 |
105509576130 has 32 divisors (see below), whose sum is σ = 289397695104. Its totient is φ = 24116474496.
The previous prime is 105509576093. The next prime is 105509576209. The reversal of 105509576130 is 31675905501.
It is a super-2 number, since 2×1055095761302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 251213067 + ... + 251213486.
It is an arithmetic number, because the mean of its divisors is an integer number (9043677972).
Almost surely, 2105509576130 is an apocalyptic number.
105509576130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105509576130 is an abundant number, since it is smaller than the sum of its proper divisors (183888118974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105509576130 is a wasteful number, since it uses less digits than its factorization.
105509576130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502426570.
The product of its (nonzero) digits is 141750, while the sum is 42.
The spelling of 105509576130 in words is "one hundred five billion, five hundred nine million, five hundred seventy-six thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •