Base | Representation |
---|---|
bin | 110001001011100110… |
… | …1011101111001011010 |
3 | 101002121120100001001110 |
4 | 1202113031131321122 |
5 | 3212300210330200 |
6 | 120304103401150 |
7 | 10426160036421 |
oct | 1422715357132 |
9 | 332546301043 |
10 | 105616105050 |
11 | 408785a0a35 |
12 | 185767531b6 |
13 | 9c621b5521 |
14 | 517cc9c2b8 |
15 | 2b322e0b50 |
hex | 189735de5a |
105616105050 has 24 divisors (see below), whose sum is σ = 261927940896. Its totient is φ = 28164294640.
The previous prime is 105616105043. The next prime is 105616105079. The reversal of 105616105050 is 50501616501.
It is a super-2 number, since 2×1056161050502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 105616104999 and 105616105017.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 352053534 + ... + 352053833.
It is an arithmetic number, because the mean of its divisors is an integer number (10913664204).
Almost surely, 2105616105050 is an apocalyptic number.
105616105050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105616105050 is an abundant number, since it is smaller than the sum of its proper divisors (156311835846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105616105050 is a wasteful number, since it uses less digits than its factorization.
105616105050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704107382 (or 704107377 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 105616105050 in words is "one hundred five billion, six hundred sixteen million, one hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •